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.

We introduce a deductive system Bal which models the logic of balance of opposing forces or of balance between conflicting evidence or influences. ‘‘Truth values’’ are interpreted as deviations from a state of equilibrium, so in this sense, the theorems of Bal are to be interpreted as balanced statements, for which reason there is only one distinguished truth value, namely the one that represents equilibrium. The main results are that the system Bal is algebraizable in the sense of [5] and (...) its equivalent algebraic semantics BAL is definitionally equivalent to the variety of abelian lattice ordered groups, that is, the categories of the algebras in BAL and of ℓ–groups are isomorphic (see [10], Ch.4, 4). We also prove the deduction theorem for Bal and we study different kinds of semantic consequence associated to Bal. Finally, we prove the co-NP-completeness of the tautology problem of Bal. (shrink)

Special groups [M. Dickmann, F. Miraglia, Special Groups : Boolean-Theoretic Methods in the Theory of Quadratic Forms, Memoirs Amer. Math. Soc., vol. 689, Amer. Math. Soc., Providence, RI, 2000] are a first-order axiomatization of the theory of quadratic forms. In Section 2 we investigate reduced special groups which are a lattice under their natural representation partial order ; we show that this lattice property is preserved under most of the standard constructions on RSGs; in particular (...) finite RSGs and RSGs of finite chain length are lattice ordered. We prove that the lattice property fails for the RSGs of function fields of real algebraic varieties over a uniquely ordered field dense in its real closure, unless their stability index is 1 . We show that Open Problem 1 has a positive answer for the RSG of the field Q . In the final section we explore the meaning of Open Problem 1 for formally real fields, in terms of their orders and real valuations; we introduce the notion of “parameter-rank” of a positive-primitive first-order formula of the language for special groups. (shrink)

We establish, generalizing Di Nola and Lettieri’s categorical equivalence, a Morita-equivalence between the theory of lattice-ordered abelian groups and that of perfect MV-algebras. Further, after observing that the two theories are not bi-interpretable in the classical sense, we identify, by considering appropriate topos-theoretic invariants on their common classifying topos, three levels of bi-interpretability holding for particular classes of formulas: irreducible formulas, geometric sentences, and imaginaries. Lastly, by investigating the classifying topos of the theory of perfect MV-algebras, we (...) obtain various results on its syntax and semantics also in relation to the cartesian theory of the variety generated by Chang’s MV-algebra, including a concrete representation for the finitely presentable models of the latter theory as finite products of finitely presentable perfect MV-algebras. Among the results established on the way, we mention a Morita-equivalence between the theory of lattice-ordered abelian groups and that of cancellative lattice-ordered abelian monoids with bottom element. (shrink)

We consider the class of pointed varieties of algebras having a lattice term reduct and we show that each such variety gives rise in a natural way, and according to a regular pattern, to at least three interesting logics. Although the mentioned class includes several logically and algebraically significant examples (e.g. Boolean algebras, MV algebras, Boolean algebras with operators, residuated lattices and their subvarieties, algebras from quantum logic or from depth relevant logic), we consider here in greater detail Abelian (...) ℓ-groups, where such logics respectively correspond to: i) Meyer and Slaney’s Abelian logic [31]; ii) Galli et al.’s logic of equilibrium [21]; iii) a new logic of “preservation of truth degrees”. (shrink)

Let G be a finite group, T denote the theory of Z[G]-lattices . It is shown that T is undecidable when there are a prime p and a p-subgroup S of G such that S is cyclic of order p4, or p is odd and S is non-cyclic of order p2, or p = 2 and S is a non-cyclic abelian group of order 8 . More precisely, first we prove that T is undecidable because it interprets the word problem (...) for finite groups; then we lift undecidability from T to T. (shrink)

We show that the 'tail' of a doubly homogeneous chain of countable cofinality can be recognized in the quotient of its automorphism group by the subgroup consisting of those elements whose support is bounded above. This extends the authors' earlier result establishing this for the rationals and reals. We deduce that any group is isomorphic to the outer automorphism group of some simple lattice-ordered group.

Let M = 〈M, +, <, 0, {λ}λ∈D〉 be an ordered vector space over an ordered division ring D, and G = 〈G, ⊕, eG〉 an n-dimensional group definable in M. We show that if G is definably compact and definably connected with respect to the t-topology, then it is definably isomorphic to a 'definable quotient group' U/L, for some convex V-definable subgroup U of 〈Mⁿ, +〉 and a lattice L of rank n. As two consequences, we (...) derive Pillay's conjecture for a saturated M as above and we show that the o-minimal fundamental group of G is isomorphic to L. (shrink)

Since Darwin, the idea of psychological continuity between humans and other animals has dominated theory and research in investigating the minds of other species. Indeed, the field of comparative psychology was founded on two assumptions. First, it was assumed that introspection could provide humans with reliable knowledge about the causal connection between specific mental states and specific behaviors. Second, it was assumed that in those cases in which other species exhibited behaviors similar to our own, similar psychological causes were at (...) work. In this paper. we show how this argument by analogy is flowed with respect to the case of second-order mental states. As a test case, we focus on the question of how other species conceive of visual attention, and in particular whether chimpanzees interpret seeing as a mentalistic event involving internal states of perception, attention, and belief. We conclude that chimpanzees do not reason about seeing in this manner, and indeed, there is considerable reason to suppose that they do not harbor representations of mental states in general. We propose a reinterpretation model in which the majority of the rich social behaviors that humans and other primates share in common emerged long before the human lineage evolved the psychological means of interpreting those behaviors in mentalistic terms. Although humans, chimpanzees, and most other species may be said to possess mental states, humans alone may have evolved a cognitive specialization for reasoning about such states. (shrink)

We describe a recent program from the study of definable groups in certain o-minimal structures. A central notion of this program is that of a lattice. We propose a definition of a lattice in an arbitrary first-order structure. We then use it to describe, uniformly, various structure theorems for o-minimal groups, each time recovering a lattice that captures some significant invariant of the group at hand. The analysis first goes through a local level, where a (...) pertinent notion of pregeometry and generic elements is each time introduced. (shrink)

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.

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.

Aim of this paper is to provide a self-contained presentation of the natural equivalence between MV-algebras and lattice-ordered abelian groups with strong unit.

A residuated lattice is said to be integrally closed if it satisfies the quasiequations \ and \, or equivalently, the equations \ and \. Every integral, cancellative, or divisible residuated lattice is integrally closed, and, conversely, every bounded integrally closed residuated lattice is integral. It is proved that the mapping \\backslash {\mathrm {e}}\) on any integrally closed residuated lattice is a homomorphism onto a lattice-ordered group. A Glivenko-style property is then established for varieties of (...) integrally closed residuated lattices with respect to varieties of lattice-ordered groups, showing in particular that integrally closed residuated lattices form the largest variety of residuated lattices admitting this property with respect to lattice-ordered groups. The Glivenko property is used to obtain a sequent calculus admitting cut-elimination for the variety of integrally closed residuated lattices and to establish the decidability, indeed PSPACE-completenes, of its equational theory. Finally, these results are related to previous work on BCI-algebras, semi-integral residuated pomonoids, and Casari’s comparative logic. (shrink)

Let Γ be Mundici’s functor from the category $${\mathcal{LG}}$$ whose objects are the lattice-ordered abelian groups ( ℓ -groups for short) with a distinguished strong order unit and the morphisms are the unital homomorphisms, onto the category $${\mathcal{MV}}$$ of MV-algebras and homomorphisms. It is shown that for each strong order unit u of an ℓ -group G , the Boolean skeleton of the MV-algebra Γ ( G , u ) is isomorphic to the Boolean algebra of (...) factor congruences of G. (shrink)

In the context of continuous logic, this paper axiomatizes both the class \ of lattice-ordered groups isomorphic to C for X compact and the subclass \ of structures existentially closed in \; shows that the theory of \ is \-categorical and admits elimination of quantifiers; establishes a Nullstellensatz for \ and \; shows that \\in \mathcal {C}\) has a prime-model extension in \ just in case X is Boolean; and proves that in a sense relevant to continuous (...) logic, positive formulas admit in \ elimination of quantifiers to positive formulas. (shrink)

Some first-order theories of divisible ℓ-groups are well known, for example the theory of the totally ordered ones and the theories of the projectable ones , Lattice-ordered Groups, Kluwer Academic Press, Dordrecht, 1989, pp. 41–79). In this paper we study some theories of nonprojectable divisible ℓ-groups, the simplest example of which is . We introduce a generalization of the projectability property . We prove that the class of r-projectable special-valued divisible ℓ-groups is an (...) elementary class and give a classification of its completions. (shrink)

Let $\scr{M}=\langle M,+,<,0,S\rangle $ be a linear o-minimal expansion of an ordered group, and $G=\langle G,\oplus ,e_{G}\rangle $ an n-dimensional group definable in $\scr{M}$ . We show that if G is definably connected with respect to the t-topology, then it is definably isomorphic to a definable quotient group U/L, for some convex ${\ssf V}\text{-definable}$ subgroup U of $\langle M^{n},+\rangle $ and a lattice L of rank equal to the dimension of the 'compact part' of G.

American Academy of Pediatrics (AAP) and American College of Medical Genetics (ACMG) recently provided two recommendations about predictive genetic testing of children. The Clinical Sequencing Exploratory Research Consortium's Pediatrics Working Group compared these recommendations, focusing on operational and ethical issues specific to decision making for children. Content analysis of the statements addresses two issues: (1) how these recommendations characterize and analyze locus of decision making, as well as the risks and benefits of testing, and (2) whether the guidelines conflict or (...) come to different but compatible conclusions because they consider different testing scenarios. These statements differ in ethically significant ways. AAP/ACMG analyzes risks and benefits using best interests of the child and recommends that, absent ameliorative interventions available during childhood, clinicians should generally decline to order testing. Parents authorize focused tests. ACMG analyzes risks and benefits using the interests of the child and other family members and recommends that sequencing results be examined for additional variants that can lead to ameliorative interventions, regardless of age, which laboratories should report to clinicians who should contextualize the results. Parents must accept additional analysis. The ethical arguments in these statements appear to be in tension with each other. (shrink)

Most donated organs in the United States come from brain dead donors, while a small percentage come from patients who die in “controlled,” or expected, circumstances, typically after the family or surrogate makes a decision to withdraw life support. The number of organs available for transplant could be substantially if donations were permitted in “uncontrolled” circumstances–that is, from people who die unexpectedly, often outside the hospital. According to projections from the Institute of Medicine, establishing programs permitting “uncontrolled donation after circulatory (...) determination of death,” or uDCDD, throughout the United States has the potential to provide 22,000 more donation opportunities annually. In contrast, U.S. controlled donation after circulatory determination of death, or cDCDD, cases have increased progressively over the past decade from 87 to 848 donors, but currently account for only 10.6 percent of all deceased donors. Following the IOM recommendations, several projects exploring the feasibility of uDCDD were funded by the federal government, including a grant from the Health Resources and Services Administration that supported a pilot project in New York City in which the authors of this article participated.A key feature of our protocol, and indeed of many uDCDD protocols, is the initiation of preservation methods such as chest compressions and extracorporeal membrane oxygenation shortly after death in order to perfuse and preserve the donor's organs. Critics of uDCDD argue that the means of determining death deviates from generally ascribed principles. They assert that reinstituting circulation in order to preserve organs has the effect of “undoing” the prior determination of death. The result is that cDCDD is widely accepted and practiced routinely even though it only marginally increases the number of organs available for transplantation, and uDCDD is widely considered unacceptable despite being ethically embraced and proven to significantly increase organ donation opportunities in other countries. This article explores the evolution of this counterintuitive state of affairs and calls for a policy that, in line with the IOM report, allows for both cDCDD and uDCDD protocols. (shrink)

We show undecidability for lattices over a group ring ${\vec Z} \, G$ where $G$ has a cyclic subgroup of order $p^3$ for some odd prime $p$ . Then we discuss the decision problem for ${\vec Z} \, G$ -lattices where $G$ is a cyclic group of order 8, and we point out that a positive answer implies – in some sense – the solution of the “wild $\Leftrightarrow$ undecidable” conjecture.

A Heyting effect algebra is a lattice-ordered effect algebra that is at the same time a Heyting algebra and for which the Heyting center coincides with the effect-algebra center. Every HEA is both an MV-algebra and a Stone-Heyting algebra and is realized as the unit interval in its own universal group. We show that a necessary and sufficient condition that an effect algebra is an HEA is that its universal group has the central comparability and central Rickart properties.

A Heyting effect algebra (HEA) is a lattice-ordered effect algebra that is at the same time a Heyting algebra and for which the Heyting center coincides with the effect-algebra center. Every HEA is both an MV-algebra and a Stone-Heyting algebra and is realized as the unit interval in its own universal group. We show that a necessary and sufficient condition that an effect algebra is an HEA is that its universal group has the central comparability and central Rickart (...) properties. (shrink)

It is well known that there is a categorical equivalence between lattice-ordered Abelian groups (or l-groups) and conical BCK-algebras (see [COR 80]). The aim of this paper is to study this equivalence from the perspective of logic, in particular, to study the relationship between two deductive systems: conical logic Co and a logic of l-groups, Balo. In [GAL 04] the authors introduce a system Bal which models the logic of balance of opposing forces with a (...) single distinguished truth value, that represents equilibrium. Its equivalent algebraic semantics BAL (via Blok-Pigozzi's construction) is definitionally equivalent to the variety of l-groups. In this paper we define the system Balo which is equivalent to Bal and whose Lindenbaum-Tarski algebra is an l-group. On the other hand, we define the conic logic Co and we prove that it can be naturally merged in the system Balo. Also, we prove that every formula of Balo has a normal form that depends on translations of formulas of Co. (shrink)

In his milestone textbook Lattice Theory, Garrett Birkhoff challenged his readers to develop a "common abstraction" that includes Boolean algebras and lattice-ordered groups as special cases. In this paper, after reviewing the past attempts to solve the problem, we provide our own answer by selecting as common generalization of ������������ and ������������ their join ������������∨������������ in the lattice of subvarieties of ������ℒ (the variety of FL-algebras); we argue that such a solution is optimal under several (...) respects and we give an explicit equational basis for ������������∨������������ relative to ������ℒ. Finally, we prove a Holland-type representation theorem for a variety of FL-algebras containing ������������∨������������. (shrink)

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 of (...) ${\vec Z}C(2)^2$ -lattices. Eventually, we show that ${\vec Z} [i] C(2)^2$ -lattices have undecidable theory. (shrink)

Classification of certain group-like FL $_e$ -chains is given: We define absorbent-continuity of FL $_e$ -algebras, along with the notion of subreal chains, and classify absorbent-continuous, group-like FL $_e$ -algebras over subreal chains: The algebra is determined by its negative cone, and the negative cone can only be chosen from a certain subclass of BL-chains, namely, one with components which are either cancellative (that is, those components are negative cones of totally ordered Abelian groups) or two-element MV-algebras, and (...) with no two consecutive cancellative components. It is shown that the classification theorem does not hold if we drop the absorbent-continuity condition. Our result is the first classification theorem in the literature on FL $_e$ -algebras that does not assume the condition of being naturally ordered (which, under certain conditions, corresponds to continuity of the monoid operation). In our classification theorem, continuity is replaced by the much weaker absorbent-continuity. (shrink)

In the present paper, we show the first-order definability of the jump operator in the upper semi-lattice of the \-enumeration degrees. As a consequence, we derive the isomorphicity of the automorphism groups of the enumeration and the \-enumeration degrees.

Necessary and sufficient conditions are presented for the (first-order) theory of a universal class of algebraic structures (algebras) to have a model completion, extending a characterization provided by Wheeler. For varieties of algebras that have equationally definable principal congruences and the compact intersection property, these conditions yield a more elegant characterization obtained (in a slightly more restricted setting) by Ghilardi and Zawadowski. Moreover, it is shown that under certain further assumptions on congruence lattices, the existence of a model completion implies (...) that the variety has equationally definable principal congruences. This result is then used to provide necessary and sufficient conditions for the existence of a model completion for theories of Hamiltonian varieties of pointed residuated lattices, a broad family of varieties that includes lattice-ordered abelian groups and MV-algebras. Notably, if the theory of a Hamiltonian variety of pointed residuated lattices has a model completion, it must have equationally definable principal congruences. In particular, the theories of lattice-ordered abelian groups and MV-algebras do not have a model completion, as first proved by Glass and Pierce, and Lacava, respectively. Finally, it is shown that certain varieties of pointed residuated lattices generated by their linearly ordered members, including lattice-ordered abelian groups and MV-algebras, can be extended with a binary operation to obtain theories that do have a model completion. (shrink)

We propose a notion of -minimality for partially ordered structures. Then we study -minimal partially ordered structures such that is a Boolean algebra. We prove that they admit prime models over arbitrary subsets and we characterize -categoricity in their setting. Finally, we classify -minimal Boolean algebras as well as -minimal measure spaces.

Part I of this paper is developed in the tradition of Stone-type dualities, where we present a new topological representation for general lattices (influenced by and abstracting over both Goldblatt's [17] and Urquhart's [46]), identifying them as the lattices of stable compact-opens of their dual Stone spaces (stability refering to a closure operator on subsets). The representation is functorial and is extended to a full duality.In part II, we consider lattice-ordered algebras (lattices with additional operators), extending the Jónsson (...) and Tarski representation results [30] for Boolean algebras with Operators. Our work can be seen as developing, and indeed completing, Dunn's project of gaggle theory [13, 14]. We consider general lattices (rather than Boolean algebras), with a broad class of operators, which we dubb normal, and which includes the Jónsson-Tarski additive operators. Representation of l-algebras is extended to full duality. (shrink)

It is shown that in a linearly ordered MV-algebra A , the implication is unique if and only if the identity function is the unique De Morgan automorphism on A . Modulo categorical equivalence, our uniqueness criterion recalls Ohkuma's rigidness condition for totally ordered abelian groups. We also show that, if A is an Archimedean totally ordered MV-algebra, then each non-trivial De Morgan automorphism of the underlying involutive lattice of A yields a new implication on (...) A , which is not isomorphic to the original implication. (shrink)

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 (...) best explained by an example. Complete separable metric spaces are essentially countable because, although the spaces may be uncountable, they can be understood in terms of a countable basis. Simpson gives the following list of areas which can be analyzed by reverse mathematics: number theory, geometry, calculus, differential equations, real and complex analysis, combinatorics, countable algebra, separable Banach spaces, computability theory, and the topology of complete separable metric spaces. Reverse mathematics is less suited to theorems of abstract functional analysis, abstract set theory, universal algebra, or general topology.Section 2 introduces the major subsystems of second order arithmetic used in reverse mathematics: RCA0, WKL0, ACA0, ATR0 and – CA0. Sections 3 through 7 consider various theorems of ordered group theory from the perspective of reverse mathematics. Among the results considered are theorems on ordered quotient groups, groups and semigroup conditions which imply orderability, the orderability of free groups, Hölder's Theorem, Mal'tsev's classification of the order types of countable ordered groups. (shrink)

We study the variety Var() of lattice-ordered monoids generated by the natural numbers. In particular, we show that it contains all 2-generated positively ordered lattice-ordered monoids satisfying appropriate distributive laws. Moreover, we establish that the cancellative totally ordered members of Var() are submonoids of ultrapowers of and can be embedded into ordered fields. In addition, the structure of ultrapowers relevant to the finitely generated case is analyzed. Finally, we provide a complete isomorphy invariant (...) in the two-generated case. (shrink)

This unique textbook states and proves all the major theorems of many-valued propositional logic and provides the reader with the most recent developments and trends, including applications to adaptive error-correcting binary search. The book is suitable for self-study, making the basic tools of many-valued logic accessible to students and scientists with a basic mathematical knowledge who are interested in the mathematical treatment of uncertain information. Stressing the interplay between algebra and logic, the book contains material never before published, such as (...) a simple proof of the completeness theorem and of the equivalence between Chang's MV algebras and Abelian lattice-ordered groups with unit - a necessary prerequisite for the incorporation of a genuine addition operation into fuzzy logic. Readers interested in fuzzy control are provided with a rich deductive system in which one can define fuzzy partitions, just as Boolean partitions can be defined and computed in classical logic. Detailed bibliographic remarks at the end of each chapter and an extensive bibliography lead the reader on to further specialised topics. (shrink)

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).