Results for ' Decidability of Ordered Groups'

973 found
Order:
  1.  31
    Decidability for ℤ2 G-lattices when G Extends the Noncyclic Group of Order 4.Annalisa Marcja & Carlo Toffalori - 2002 - Mathematical Logic Quarterly 48 (2):203-212.
    Let G be the direct sum of the noncyclic groupof order four and a cyclic groupwhoseorderisthe power pn of some prime p. We show that ℤ2G-lattices have a decidable theory when the cyclotomic polynomia equation image is irreducible modulo 2ℤ for every j ≤ n. More generally we discuss the decision problem for ℤ2G-lattices when G is a finite group whose Sylow 2-subgroups are isomorphic to the noncyclic group of order four.
    Direct download  
     
    Export citation  
     
    Bookmark  
  2.  11
    Decidability Results for Classes of Ordered Abelian Groups in Logics with Ramsey-Quantifiers.Wolfgang Lenski - 1995 - In Michał Krynicki, Marcin Mostowski & Lesław W. Szczerba (eds.), Quantifiers: Logics, Models and Computation: Volume Two: Contributions. Dordrecht, Netherland: Kluwer Academic Publishers. pp. 139--168.
    Direct download  
     
    Export citation  
     
    Bookmark  
  3.  24
    Free abelian lattice-ordered groups.A. M. W. Glass, Angus Macintyre & Françoise Point - 2005 - Annals of Pure and Applied Logic 134 (2-3):265-283.
    Let n be a positive integer and FAℓ be the free abelian lattice-ordered group on n generators. We prove that FAℓ and FAℓ do not satisfy the same first-order sentences in the language if m≠n. We also show that is decidable iff n{1,2}. Finally, we apply a similar analysis and get analogous results for the free finitely generated vector lattices.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  4.  26
    Existential equivalence of ordered abelian groups with parameters.V. Weispfenning - 1990 - Archive for Mathematical Logic 29 (4):237-248.
    In [GK], Gurevich and Kokorin proved that any two non-trivial ordered abelian groups (o-groups, for short) satisfy the same existential sentences. Let nowG, H be non-trivialo-groups with a commono-subgroupG 0. We determine whetherG andH are existentially equivalent overG 0. As a corollary, we obtain algebraic criteria for deciding, whether ano-subgroupG is existentially closed in ano-groupH. Corresponding results are proved foro-groups in which congruences are regarded as atomic relations.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  5.  15
    Some Decidability Results for ℤ[G]‐Modules when G is Cyclic of Squarefree Order.Carlo Toffalori - 1996 - Mathematical Logic Quarterly 42 (1):433-445.
    We extend the analysis of the decision problem for modules over a group ring ℤ[G] to the case when G is a cyclic group of squarefree order. We show that separated ℤ[G]-modules have a decidable theory, and we discuss the model theoretic role of these modules within the class of all ℤ[G]-modules. The paper includes a short analysis of the decision problem for the theories of modules over ℤ[ζm], where m is a positive integer and ζm is a primitive mth (...)
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  6.  26
    (1 other version)Kingdoms and crowds: William Ockham on the ontology of social groups.Jenny Pelletier - 2021 - British Journal for the History of Philosophy 29 (1):24-44.
    ABSTRACT This paper reconstructs William of Ockham's (c. 1287–1347) account of the ontology of social groups. Across his writings, Ockham mentions kingdoms, religious orders, crowds, people, armies, and corporations. Using the political community as a case-study against the background of Ockham’s metaphysics of parts and wholes, it is argued that at least some social groups are identical to a plurality of many human beings who have decided to order themselves with respect to another in some particular way. In (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  7.  29
    Decidability for ℤ[G]‐Modules when G is Cyclic of Prime Order.Carlo Toffalori - 1996 - Mathematical Logic Quarterly 42 (1):369-378.
    We consider the decision problem for modules over a group ring ℤ[G], where G is a cyclic group of prime order. We show that it reduces to the same problem for a class of certain abelian structures, and we obtain some partial decidability results for this class.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  8.  38
    The theory of {vec Z}C(2)^2-lattices is decidable.Stefano Baratella & Carlo Toffalori - 1998 - Archive for Mathematical Logic 37 (2):91-104.
    For arbitrary finite group $G$ and countable Dedekind domain $R$ such that the residue field $R/P$ is finite for every maximal $R$ -ideal $P$ , we show that the localizations at every maximal ideal of two $RG$ -lattices are isomorphic if and only if the two lattices satisfy the same first order sentences. Then we investigate generalizations of the above results to arbitrary $R$ -torsion-free $RG$ -modules and we apply the previous results to show the decidability of the theory (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  9.  59
    Un Principe d'ax-kochen-Ershov pour Des structures intermediares entre groupes et corps values.Francoise Delon & Patrick Simonetta - 1999 - Journal of Symbolic Logic 64 (3):991-1027.
    An Ax-Kochen-Ershov principle for intermediate structures between valued groups and valued fields. We will consider structures that we call valued B-groups and which are of the form $\langle G, B, *, v\rangle$ where - G is an abelian group, - B is an ordered group, - v is a valuation defined on G taking its values in B, - * is an action of B on G satisfying: ∀ x ∈ G ∀ b ∈ B v(x * (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark  
  10. Decidability of Ordered Fragments of FOL via Modal Translation.Hongkai Yin & Matteo Pascucci - 2024 - In Emanuele De Angelis & Maurizio Proietti (eds.), Proceedings of CILC 2024. CEUR. pp. 1-15, article n. 17.
    We present a simplification and a modification of a method introduced by Herzig to prove the decidability of Quine’s ordered fragment of first-order logic. The method consists in an interpretation of quantifiers as modal operators. We show that our modification yields the decidability of two new ordered fragments of first-order logic, called the grooved fragment and the loosely grooved fragment, whose expressive power lies between Quine’s ordered fragment and the fluted fragment.
     
    Export citation  
     
    Bookmark  
  11.  22
    Comparing First Order Theories of Modules over Group Rings.Saverio Cittadini & Carlo Toffalori - 2002 - Mathematical Logic Quarterly 48 (1):147-156.
    We consider R-torsionfree modules over group rings RG, where R is a Dedekind domain and G is a finite group. In the first part of the paper [4] we compared the theory T of all R-torsionfree RG-modules and the theory T0 of RG-lattices , and we realized that they are almost always different. Now we compare their behaviour with respect to decidability, when RG-lattices are of finite, or wild representation type.
    Direct download  
     
    Export citation  
     
    Bookmark  
  12. Group decisions in humans and animals: a survey.Christian List - 2009 - Philosophical Transactions of the Royal Society B 364:719-742.
    Humans routinely make many decisions collectively, whether they choose a restaurant with friends, elect political leaders or decide actions to tackle international problems, such as climate change, that affect the future of the whole planet. We might be less aware of it, but group decisions are just as important to social animals as they are for us. Animal groups have to collectively decide about communal movements, activities, nesting sites and enterprises, such as cooperative breeding or hunting, that crucially affect (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  13.  37
    Let the consumer decide? The regulation of commercial genetic testing.Mairi Levitt - 2001 - Journal of Medical Ethics 27 (6):398-403.
    Objectives—The development of predictive genetic tests provides a new area where consumers can gain knowledge of their health status and commercial opportunities. “Over-the-counter” or mail order genetic tests are most likely to provide information on carrier status or the risk of developing a multifactorial disease. The paper considers the social and ethical implications of individuals purchasing genetic tests and whether genetic information is different from other types of health information which individuals can obtain for themselves.Design—The discussion is illustrated by findings (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   7 citations  
  14. Group Belief: Defending a minimal version of summativism.Domingos Faria - 2021 - Epistemology and Philosophy of Science 58 (1):82-93.
    Beliefs are commonly attributed to groups or collective entities. But what is the nature of group belief? Summativism and nonsummativism are two main rival views regarding the nature of group belief. On the one hand, summativism holds that, necessarily, a group g has a belief B only if at least one individual i is both a member of g and has B. On the other hand, non-summativism holds that it is possible for a group g to have a belief (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   4 citations  
  15.  26
    Logical aspects of Cayley-graphs: the group case.Dietrich Kuske & Markus Lohrey - 2004 - Annals of Pure and Applied Logic 131 (1-3):263-286.
    We prove that a finitely generated group is context-free whenever its Cayley-graph has a decidable monadic second-order theory. Hence, by the seminal work of Muller and Schupp, our result gives a logical characterization of context-free groups and also proves a conjecture of Schupp. To derive this result, we investigate general graphs and show that a graph of bounded degree with a high degree of symmetry is context-free whenever its monadic second-order theory is decidable. Further, it is shown that the (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  16.  25
    Abelian‐by‐G Groups, for G Finite, from the Model Theoretic Point of View.Annalisa Marcja & Carlo Toffalori - 1994 - Mathematical Logic Quarterly 40 (1):125-131.
    Let G be a finite group. We prove that the theory af abelian-by-G groups is decidable if and only if the theory of modules over the group ring ℤ[G] is decidable. Then we study some model theoretic questions about abelian-by-G groups, in particular we show that their class is elementary when the order of G is squarefree.
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation  
  17.  27
    On Decidability of a Logic for Order of Magnitude Qualitative Reasoning with Bidirectional Negligibility.Joanna Golinska-Pilarek - 2012 - In Luis Farinas del Cerro, Andreas Herzig & Jerome Mengin (eds.), Logics in Artificial Intelligence. Springer. pp. 255--266.
    Qualitative Reasoning (QR) is an area of research within Artificial Intelligence that automates reasoning and problem solving about the physical world. QR research aims to deal with representation and reasoning about continuous aspects of entities without the kind of precise quantitative information needed by conventional numerical analysis techniques. Order-of-magnitude Reasoning (OMR) is an approach in QR concerned with the analysis of physical systems in terms of relative magnitudes. In this paper we consider the logic OMR_N for order-of-magnitude reasoning with the (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  18. A proof of completeness for continuous first-order logic.Itaï Ben Yaacov & Arthur Paul Pedersen - 2010 - Journal of Symbolic Logic 75 (1):168-190.
    -/- Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) to various natural classes of complete metric structures (such as probability algebras, Hilbert spaces, and Banach spaces). With research in continuous first-order logic preoccupied with studying the model theory of this framework, we find a natural question calls for attention. Is there an interesting set of axioms yielding a completeness result? -/- The primary purpose (...)
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  19.  15
    Decidability of the theory of modules over Prüfer domains with dense value groups.Lorna Gregory, Sonia L'Innocente & Carlo Toffalori - 2019 - Annals of Pure and Applied Logic 170 (12):102719.
    We provide algebraic conditions ensuring the decidability of the theory of modules over effectively given Prüfer (in particular Bézout) domains whose localizations at maximal ideals have dense value groups. For Bézout domains, these conditions are also necessary.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  20.  23
    On decidability of amenability in computable groups.Karol Duda & Aleksander Ivanov - 2022 - Archive for Mathematical Logic 61 (7):891-902.
    The main result of the paper states that there is a finitely presented group _G_ with decidable word problem where detection of finite subsets of _G_ which generate amenable subgroups is not decidable.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  21.  46
    Let the consumer decide? The regulation of commercial genetic testing.D. M. Levitt - 2001 - Journal of Medical Ethics 27 (6):398-403.
    Objectives—The development of predictive genetic tests provides a new area where consumers can gain knowledge of their health status and commercial opportunities. “Over-the-counter” or mail order genetic tests are most likely to provide information on carrier status or the risk of developing a multifactorial disease. The paper considers the social and ethical implications of individuals purchasing genetic tests and whether genetic information is different from other types of health information which individuals can obtain for themselves.Design—The discussion is illustrated by findings (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  22. Group Theory and Computational Linguistics.Dymetman Marc - 1998 - Journal of Logic, Language and Information 7 (4):461-497.
    There is currently much interest in bringing together the tradition of categorial grammar, and especially the Lambek calculus, with the recent paradigm of linear logic to which it has strong ties. One active research area is designing non-commutative versions of linear logic (Abrusci, 1995; Retoré, 1993) which can be sensitive to word order while retaining the hypothetical reasoning capabilities of standard (commutative) linear logic (Dalrymple et al., 1995). Some connections between the Lambek calculus and computations in groups have long (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  23.  77
    In Quest of 'Good' Medical Classification Systems.Lara K. Kutschenko - 2011 - Medicine Studies 3 (1):53-70.
    Medical classification systems aim to provide a manageable taxonomy for sorting diagnoses into their proper classes. The question, this paper wants to critically examine, is how to correctly systematise diseases within classification systems that are applied in a variety of different settings. ICD and DSM , the two major classification systems in medicine and psychiatry, will be the main subjects of this paper; however, the arguments are not restricted to these classification systems but point out general methodological and epistemological challenges (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  24. Decidability of First-order Logic.Timm Lampert - 2007 - Ruch Filozoficzny 4 (4).
     
    Export citation  
     
    Bookmark  
  25.  35
    Back and forth relations for reduced abelian p-groups.Ewan J. Barker - 1995 - Annals of Pure and Applied Logic 75 (3):223-249.
    In order to apply known general theorems about the effective properties of recursive structures in a particular recursive structure, it is necessary to verify that certain decidability conditions are satisfied. This requires the determination of when certain relations, called back and forth relations, hold between finite strings of elements from the structure. Here we determine this for recursive reduced abelian p-groups, thus enabling us to apply these theorems.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  26. (1 other version)Decidability of First-Order Logic Exemplified. Part I.Timm Lampert - 2008 - Ruch Filozoficzny 65 (3).
     
    Export citation  
     
    Bookmark   1 citation  
  27.  32
    Constructive completions of ordered sets, groups and fields.Erik Palmgren - 2005 - Annals of Pure and Applied Logic 135 (1-3):243-262.
    In constructive mathematics it is of interest to consider a more general, but classically equivalent, notion of linear order, a so-called pseudo-order. The prime example is the order of the constructive real numbers. We examine two kinds of constructive completions of pseudo-orders: order completions of pseudo-orders and Cauchy completions of ordered groups and fields. It is shown how these can be predicatively defined in type theory, also when the underlying set is non-discrete. Provable choice principles, in particular a (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  28.  22
    Definable Tietze extension property in o-minimal expansions of ordered groups.Masato Fujita - 2023 - Archive for Mathematical Logic 62 (7):941-945.
    The following two assertions are equivalent for an o-minimal expansion of an ordered group $$\mathcal M=(M,<,+,0,\ldots )$$. There exists a definable bijection between a bounded interval and an unbounded interval. Any definable continuous function $$f:A \rightarrow M$$ defined on a definable closed subset of $$M^n$$ has a definable continuous extension $$F:M^n \rightarrow M$$.
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  29.  13
    Algebraic and Model Theoretic Properties of O-minimal Exponential Fields.Lothar Sebastian Krapp - 2021 - Bulletin of Symbolic Logic 27 (4):529-530.
    An exponential $\exp $ on an ordered field $$. The structure $$ is then called an ordered exponential field. A linearly ordered structure $$ is called o-minimal if every parametrically definable subset of M is a finite union of points and open intervals of M.The main subject of this thesis is the algebraic and model theoretic examination of o-minimal exponential fields $$ whose exponential satisfies the differential equation $\exp ' = \exp $ with initial condition $\exp = (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  30. (1 other version)Forms of Luminosity: Epistemic Modality and Hyperintensionality in Mathematics.David Elohim - 2017 - Dissertation, Arché, University of St Andrews
    This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. David Elohim examines the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable (...)
    Direct download  
     
    Export citation  
     
    Bookmark   5 citations  
  31.  23
    A Syntactic Proof of the Decidability of First-Order Monadic Logic.Eugenio Orlandelli & Matteo Tesi - 2024 - Bulletin of the Section of Logic 53 (2):223-244.
    Decidability of monadic first-order classical logic was established by Löwenheim in 1915. The proof made use of a semantic argument and a purely syntactic proof has never been provided. In the present paper we introduce a syntactic proof of decidability of monadic first-order logic in innex normal form which exploits G3-style sequent calculi. In particular, we introduce a cut- and contraction-free calculus having a (complexity-optimal) terminating proof-search procedure. We also show that this logic can be faithfully embedded in (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  32.  36
    Decidability of Scott's Model as an Ordered $\mathbb{Q}$-Vectorspace.Miklós Erdélyi-Szabó - 1997 - Journal of Symbolic Logic 62 (3):917-924.
    Let $L = \langle, +, h_q, 1\rangle_{q \in \mathbb{Q}}$ where $\mathbb{Q}$ is the set of rational numbers and $h_q$ is a one-place function symbol corresponding to multiplication by $q$. Then the $L$-theory of Scott's model for intuitionistic analysis is decidable.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  33. Degrees of orders on torsion-free Abelian groups.Asher M. Kach, Karen Lange & Reed Solomon - 2013 - Annals of Pure and Applied Logic 164 (7-8):822-836.
    We show that if H is an effectively completely decomposable computable torsion-free abelian group, then there is a computable copy G of H such that G has computable orders but not orders of every degree.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  34.  50
    Moral distress in paediatric oncology: Contributing factors and group differences.Pernilla Pergert, Cecilia Bartholdson, Klas Blomgren & Margareta af Sandeberg - 2019 - Nursing Ethics 26 (7-8):2351-2363.
    Background: Providing oncological care to children is demanding and ethical issues concerning what is best for the child can contribute to moral distress. Objectives: To explore healthcare professionals’ experiences of situations that generate moral distress in Swedish paediatric oncology. Research design: In this national study, data collection was conducted using the Swedish Moral Distress Scale-Revised. The data analysis included descriptive statistics and non-parametric analysis of differences between groups. Participants and research context: Healthcare professionals at all paediatric oncology centres in (...)
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  35. Decidability of cylindric set algebras of dimension two and first-order logic with two variables.Maarten Marx & Szabolcs Mikulas - 1999 - Journal of Symbolic Logic 64 (4):1563-1572.
    The aim of this paper is to give a new proof for the decidability and finite model property of first-order logic with two variables (without function symbols), using a combinatorial theorem due to Herwig. The results are proved in the framework of polyadic equality set algebras of dimension two (Pse 2 ). The new proof also shows the known results that the universal theory of Pse 2 is decidable and that every finite Pse 2 can be represented on a (...)
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  36.  21
    Decision-making ethics in regards to life-sustaining interventions: when physicians refer to what other patients decide.Eve Rubli Truchard, Ralf J. Jox & Anca-Cristina Sterie - 2022 - BMC Medical Ethics 23 (1):1-13.
    BackgroundHealth decisions occur in a context with omnipresent social influences. Information concerning what other patients decide may present certain interventions as more desirable than others.ObjectivesTo explore how physicians refer to what other people decide in conversations about the relevancy of cardio-pulmonary resuscitation or do-not-attempt-resuscitation orders.MethodsWe recorded forty-three physician–patient admission interviews taking place in a hospital in French-speaking Switzerland, during which CPR is discussed. Data was analysed with conversation analysis.ResultsReference to what other people decide in regards to CPR is used five (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  37.  15
    Whether scientists should try to go it alone: a formal model for the risk of split of a scientific community.Thomas Boyer - unknown
    In this paper, I address a question in social epistemology about the unity of a scientic community to- wards its inner groups (teams, labs...). I investigate the reasons why these groups might want to \go it alone", working among themselves and hiding their discoveries from other groups. I concentrate on the intermediate results of a longer project, where the first steps can help to achieve a more advanced result. I study to what extent the isolation of research (...)
    Direct download  
     
    Export citation  
     
    Bookmark  
  38. Ordered groups: A case study in reverse mathematics.Reed Solomon - 1999 - Bulletin of Symbolic Logic 5 (1):45-58.
    The fundamental question in reverse mathematics is to determine which set existence axioms are required to prove particular theorems of mathematics. In addition to being interesting in their own right, answers to this question have consequences in both effective mathematics and the foundations of mathematics. Before discussing these consequences, we need to be more specific about the motivating question.Reverse mathematics is useful for studying theorems of either countable or essentially countable mathematics. Essentially countable mathematics is a vague term that is (...)
    Direct download (11 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  39.  23
    Arithmetic of Dedekind cuts of ordered Abelian groups.Antongiulio Fornasiero & Marcello Mamino - 2008 - Annals of Pure and Applied Logic 156 (2):210-244.
    We study Dedekind cuts on ordered Abelian groups. We introduce a monoid structure on them, and we characterise, via a suitable representation theorem, the universal part of the theory of such structures.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  40.  49
    Completeness and Decidability of General First-Order Logic.Aldo Antonelli - 2017 - Journal of Philosophical Logic 46 (3):233-257.
    This paper investigates the “general” semantics for first-order logic introduced to Antonelli, 637–58, 2013): a sound and complete axiom system is given, and the satisfiability problem for the general semantics is reduced to the satisfiability of formulas in the Guarded Fragment of Andréka et al. :217–274, 1998), thereby showing the former decidable. A truth-tree method is presented in the Appendix.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  41.  27
    The Boolean algebras of Abelian groups and well-orders.Dale Myers - 1974 - Journal of Symbolic Logic 39 (3):452-458.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  42.  31
    Essentially periodic ordered groups.Françoise Point & Frank O. Wagner - 2000 - Annals of Pure and Applied Logic 105 (1-3):261-291.
    A totally ordered group G is essentially periodic if for every definable non-trivial convex subgroup H of G every definable subset of G is equal to a finite union of cosets of subgroups of G on some interval containing an end segment of H; it is coset-minimal if all definable subsets are equal to a finite union of cosets, intersected with intervals. We study definable sets and functions in such groups, and relate them to the quasi-o-minimal groups (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  43.  15
    On the Decidability of Some Problems in Special Classes of Groups.A. Wlodzimierz Mostowski - 1970 - Journal of Symbolic Logic 35 (3):476-477.
  44.  27
    On the completeness and the decidability of strictly monadic second‐order logic.Kento Takagi & Ryo Kashima - 2020 - Mathematical Logic Quarterly 66 (4):438-447.
    Regarding strictly monadic second‐order logic (SMSOL), which is the fragment of monadic second‐order logic in which all predicate constants are unary and there are no function symbols, we show that a standard deductive system with full comprehension is sound and complete with respect to standard semantics. This result is achieved by showing that in the case of SMSOL, the truth value of any formula in a faithful identity‐standard Henkin structure is preserved when the structure is “standardized”; that is, the predicate (...)
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  45. International law and morality in the theory of secession.David Copp - 1998 - The Journal of Ethics 2 (3):219-245.
    In order responsibly to decide whether there ought to be an international legal right of secession, I believe we need an account of the morality of secession. I propose that territorial and political societies have a moral right to secede, and on that basis I propose a regime designed to give such groups an international legal right to secede. This regime would create a procedure that could be followed by groups desiring to secede or by states desiring to (...)
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  46.  17
    Decidability of a Hybrid Duration Calculus.Thomas Bolander, Jens Ulrik Hansen & Michael R. Hansen - 2007 - Electronic Notes in Theoretical Computer Science 174 (3):113-133.
    We present a logic which we call Hybrid Duration Calculus. HDC is obtained by adding the following hybrid logical machinery to the Restricted Duration Calculus : nominals, satisfaction operators, down-arrow binder, and the global modality. RDC is known to be decidable, and in this paper we show that decidability is retained when adding the hybrid logical machinery. Decidability of HDC is shown by reducing the satisfiability problem to satisfiability of Monadic Second-Order Theory of Order. We illustrate the increased (...)
    No categories
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  47.  19
    Processing of Ordinal Information in Math-Anxious Individuals.Àngels Colomé & Maria Isabel Núñez-Peña - 2021 - Frontiers in Psychology 12.
    This study aimed to investigate whether the ordinal judgments of high math-anxious and low math-anxious individuals differ. Two groups of 20 participants with extreme scores on the Shortened Mathematics Anxiety Rating Scale had to decide whether a triplet of numbers was presented in ascending order. Triplets could contain one-digit or two-digit numbers and be formed by consecutive numbers, numbers with a constant distance of two or three or numbers with variable distances between them. All these triplets were also presented (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  48.  9
    Ordered Groups, Computability and Cantor-Bendixson Rank.Waseet Kazmi - 2023 - Bulletin of Symbolic Logic 29 (4):664-664.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  49.  48
    The Annual Meeting of the Society for Buddhist-Christian Studies: Atlanta, Georgia, USA, 29-30 October 2010.Sandra Costen Kunz - 2011 - Buddhist-Christian Studies 31:221-223.
    In lieu of an abstract, here is a brief excerpt of the content:The Annual Meeting of the Society for Buddhist-Christian Studies:Atlanta, Georgia, USA, 29-30 October 2010Sandra Costen KunzThis past fall the Society for Buddhist-Christian Studies (SBCS) presented two sessions at the annual meeting of the American Academy of Religion (AAR) in Atlanta, Georgia. On Friday afternoon, 29 October, an extremely well-attended and in many ways inspiring session titled "The Scholarly Contributions of Rita M. Gross" was presented. The second panel, titled (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  50. Reverse Mathematics and Fully Ordered Groups.Reed Solomon - 1998 - Notre Dame Journal of Formal Logic 39 (2):157-189.
    We study theorems of ordered groups from the perspective of reverse mathematics. We show that suffices to prove Hölder's Theorem and give equivalences of both (the orderability of torsion free nilpotent groups and direct products, the classical semigroup conditions for orderability) and (the existence of induced partial orders in quotient groups, the existence of the center, and the existence of the strong divisible closure).
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   10 citations  
1 — 50 / 973