In this paper we investigate the properties of automorphism groups of countable short recursively saturated models of arithmetic. In particular, we show that Kaye's Theorem concerning the closed normal subgroups of automorphism groups of countable recursively saturated models of arithmetic applies to automorphism groups of countable short recursively saturated models as well. That is, the closed normal subgroups of the automorphism group of a countable short recursively saturated model of PA are exactly the stabilizers of the invariant cuts of the (...) model which are closed under exponentiation. This Galois correspondence is used to show that there are countable short recursively saturated models of arithmetic whose automorphism groups are not isomorphic as topological groups. Moreover, we show that the automorphism groups of countable short arithmetically saturated models of PA are not topologically isomorphic to the automorphism groups of countable short recursively saturated models of PA which are not short arithmetically saturated. (shrink)

The concept of Galois connection between power sets is generalized from the point of view of fuzzy logic. Studied is the case where the structure of truth values forms a complete residuated lattice. It is proved that fuzzy Galois connections are in one-to-one correspondence with binary fuzzy relations. A representation of fuzzy Galois connections by Galois connections is provided.

We revisit Kolchin's results on definability of differential Galois groups of strongly normal extensions, in the case where the field of constants is not necessarily algebraically closed. In certain classes of differential topological fields, which encompasses ordered or p‐valued differential fields, we find a partial Galois correspondence and we show one cannot expect more in general. In the class of ordered differential fields, using elimination of imaginaries in, we establish a relative Galois correspondence for relatively (...) definable subgroups of the group of differential order automorphisms. (shrink)

We present a way of topologizing sets of Galois types over structures in abstract elementary classes with amalgamation. In the elementary case, the topologies thus produced refine the syntactic topologies familiar from first order logic. We exhibit a number of natural correspondences between the model-theoretic properties of classes and their constituent models and the topological properties of the associated spaces. Tameness of Galois types, in particular, emerges as a topological separation principle. © 2011 WILEY-VCH Verlag GmbH & Co. (...) KGaA, Weinheim. (shrink)

We construct a Galois connection between closure and interior operators on a given set. All arguments are intuitionistically valid. Our construction is an intuitionistic version of the classical correspondence between closure and interior operators via complement.

We analyze the notions of indiscernibility and indeterminacy in the light of the Galois theory of field extensions and the generalization to \(K\) -algebras proposed by Grothendieck. Grothendieck’s reformulation of Galois theory permits to recast the Galois correspondence between symmetry groups and invariants as a Galois–Grothendieck duality between \(G\) -spaces and the minimal observable algebras that discern (or separate) their points. According to the natural epistemic interpretation of the original Galois theory, the possible \(K\) (...) -indiscernibilities between the roots of a polynomial \(p(x)\in K[x]\) result from the limitations of the field \(K\) . We discuss the relation between this epistemic interpretation of the Galois–Grothendieck duality and Leibniz’s principle of the identity of indiscernibles. We then use the conceptual framework provided by Klein’s Erlangen program to propose an alternative ontologic interpretation of this duality. The Galoisian symmetries are now interpreted in terms of the automorphisms of the symmetric geometric figures that can be placed in a background Klein geometry. According to this interpretation, the Galois–Grothendieck duality encodes the compatibility condition between geometric figures endowed with groups of automorphisms and the ‘observables’ that can be consistently evaluated at such figures. In this conceptual framework, the Galoisian symmetries do not encode the epistemic indiscernibility between individuals, but rather the intrinsic indeterminacy in the pointwise localization of the figures with respect to the background Klein geometry. (shrink)

We analyze the notion of indiscernibility in the light of the Galois theory of field extensions and the generalization to K-algebras proposed by Grothendieck. Grothendieck's reformulation of Galois theory permits to recast the Galois correspondence between symmetry groups and invariants as a duality between G-spaces and the minimal observable algebras that separate theirs points. In order to address the Galoisian notion of indiscernibility, we propose what we call an epistemic reading of the Galois-Grothendieck theory. According (...) to this viewpoint, the Galoisian notion of indiscernibility results from the limitations of the `resolving power' of the observable algebras used to discern the corresponding `coarse-grained' states. The resulting Galois-Grothendieck duality is rephrased in the form of what we call a Galois indiscernibility principle. According to this principle, there exists an inverse correlation between the coarsegrainedness of the states and the size of the minimal observable algebra that discern these states. (shrink)

In this paper we develop an abstract theory of adequacy. In the same way as the theory of consequence operations is a general theory of logic, this theory of adequacy is a general theory of the interactions and connections between consequence operations and its sound and complete semantics. Addition of axioms for the connectives of propositional logic to the basic axioms of consequence operations yields a unifying framework for different systems of classical propositional logic. We present an abstract model-theoretical semantics (...) based on model mappings and theory mappings. Between the classes of models and theories, i.e., the set of sentences verified by a model, it obtains a connection that is well-known within algebra as Galois correspondence. Many basic semantical properties can be derived from this observation. A sentence A is a semantical consequence of T if every model of T is also a model of A. A model mapping is adequate for a consequence operation if its semantical inference operation is identical with the consequence operation. We study how properties of an adequate model mapping reflect the properties of the consequence operation and vice versa. In particular, we show how every concept of the theory of consequence operations can be formulated semantically. (shrink)

We study the degree of elimination of imaginaries needed for the three main applications: to have canonical bases for types over models, to define strong types as types over algebraically closed sets and to have a Galois correspondence between definably closed sets B such that A ⊆ B ⊆ acl and closed subgroups of the Galois group Aut/A). We also characterize when the topology of the Galois group is the quotient topology.

Before examining de Moivre's contributions to the science of mathematics, this article reviews the source materials, consisting of the printed works and the correspondence of de Moivre, and constructs his biography from them. The analytical part examines de Moivre's contributions and achievements in the study of equations, series, and the calculus of probability. De Moivre contributed to the continuing development from Viète to Abel and Galois of the theory of solving equations by means of constructing particular equations, the (...) roots of which can be written in the form $$\sqrt[n]{{a + \sqrt b }} + \sqrt[n]{{a - \sqrt b }}$$. He also discovered the reciprocal equations. In the course of this work de Moivre discovered an expression equivalent to (cos α+i sin α) n =cos n α+i sin n α and, following Cotes, he succeeded in expressing the nth roots of unity in trigonometric form. In the theory of series, de Moivre developed a polynomial theorem encom-passing Newton's binomial theorem and, in particular, a theorem of recurrent series useful in the calculus of probability. The demands of the calculus of probability led de Moivre to an approximation for the binomial coefficients $$\left( {_m^n } \right)$$ for large values of n. The interaction between de Moivre and James Stirling, particularly in regard to the asymptotic series for log (n!), is treated at length. This work supplied the foundation for de Moivre's limit theorem for the binomial distribution. The calculus of probability, which occupied him from 1708 onward, became in time ever more the center of de Moivre's inquiries. Proceeding from contemporary collections of gambling exercises, de Moivre, by introducing an explicit measure of probability for the so-called Laplace experiments, found the beginnings of a theory of probability. De Moivre expanded the classic application of probability calculus to games of chance by addressing himself to the problem of annuities and by adopting Halley's work with its conception of “Probability of life”. De Moivre was the first to publish a mathematically formulated law for the decrements of life derived from mortality tables. (shrink)

As it was proved in [4, Sect. 3], the poset of extensions of the propositional logic defined by a class of logical matrices with equationally-definable set of distinguished values is a retract, under a Galois connection, of the poset of subprevarieties of the prevariety generated by the class of the underlying algebras of the defining matrices. In the present paper we apply this general result to the three-valued paraconsistent logic proposed by Hałkowska–Zajac [2]. Studying corresponding prevarieties, we prove that (...) extensions of the logic involved form a four-element chain, the only proper consistent extensions being the least non-paraconsistent extension of it and the classical logic. RID=""ID="" Mathematics Subject Classification (2000): 03B50, 03B53, 03G10 RID=""ID="" Key words or phrases: Many-valued logic – Paraconsistent logic – Extension – Prevariety – Distributive lattice. (shrink)

The dual character of invariance under transformations and definability by some operations has been used in classical works by, for example, Galois and Klein. Following Tarski, philosophers of logic have claimed that logical notions themselves could be characterized in terms of invariance. In this article, we generalize a correspondence due to Krasner between invariance under groups of permutations and definability in L∞∞ so as to cover the cases that are of interest in the logicality debates, getting McGee’s theorem (...) about quantifiers invariant under all permutations and definability in pure L∞∞ as a particular case. We also prove some optimality results along the way, regarding the kinds of relations which are needed so that every subgroup of the full permutation group is characterizable as a group of automorphisms. (shrink)

Defining a composition operation on sets of formulas one obtains a many-sorted algebra which satisfies the superassociative law and one more identity. This algebra is called the clone of formulas of the given type. The interpretations of formulas on an algebraic system of the same type form a many-sorted algebra with similar properties. The satisfaction of a formula by an algebraic system defines a Galois connection between classes of algebraic systems of the same type and collections of formulas. Hypersubstitutions (...) are mappings sending pairs of operation symbols to pairs of terms of the corresponding arities and relation symbols to formulas of the same arities. Using hypersubstitutions we define hyperformulas. Satisfaction of a hyperformula by an algebraic system defines a second Galois connection between classes of algebraic systems of the same type and collections of formulas. A class of algebraic systems is said to be solid if every formula which is satisfied is also satisfied as a hyperformula. On the basis of these two Galois connections we construct a conjugate pair of additive closure operators and are able to characterize solid classes of algebraic systems. (shrink)

In this paper, notions of fuzzy closure system and fuzzy closure L—system on L—ordered sets are introduced from the fuzzy point of view. We first explore the fundamental properties of fuzzy closure systems. Then the correspondence between fuzzy closure systems and fuzzy closure operators is established. Finally, we study the connections between fuzzy closure systems and fuzzy Galois connections. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Nonclassical logics have played an increasing role in recent years in disciplines ranging from mathematics and computer science to linguistics and philosophy. _Generalized Galois Logics_ develops a uniform framework of relational semantics to mediate between logical calculi and their semantics through algebra. This volume addresses normal modal logics such as K and S5, and substructural logics, including relevance logics, linear logic, and Lambek calculi. The authors also treat less-familiar and new logical systems with equal deftness.

The concept of fuzzy Galois connections is defined on fuzzy posets with Bělohlávek's fuzzy Galois connections as a special case. The properties of fuzzy Galois connections are investigated. Then the relations between fuzzy Galois connections and fuzzy closure operators, fuzzy interior operators are studied.

We introduce tame abstract elementary classes as a generalization of all cases of abstract elementary classes that are known to permit development of stability-like theory. In this paper, we explore stability results in this new context. We assume that [Formula: see text] is a tame abstract elementary class satisfying the amalgamation property with no maximal model. The main results include:. Theorem 0.1. Suppose that [Formula: see text] is not only tame, but [Formula: see text]-tame. If [Formula: see text] and [Formula: (...) see text] is Galois stable in μ, then [Formula: see text], where [Formula: see text] is a relative of κ from first order logic. [Formula: see text] is the Hanf number of the class [Formula: see text]. It is known that [Formula: see text]. The theorem generalizes a result from [17]. It is used to prove both the existence of Morley sequences for non-splitting and the following initial step towards a stability spectrum theorem for tame classes:. Theorem 0.2. If [Formula: see text] is Galois-stable in some [Formula: see text], then [Formula: see text] is stable in every κ with κμ=κ. For example, under GCH we have that [Formula: see text] Galois-stable in μ implies that [Formula: see text] is Galois-stable in μ+n for all n < ω. (shrink)

In his testamentary letter to Auguste Chevalier, Évariste Galois states that, in modern terminology, the smallest simple group has order 60. No proof of this statement survives in his papers, and it has been suggested that a proof would have been impossible using the methods available at the time. We argue that this assertion is unduly pessimistic. Moreover, one fragmentary document, dismissed as a triviality and misunderstood, looks suspiciously like cryptic notes related to this result. We give an elementary (...) proof of Galois’s statement, explain why it is likely that he would have been aware of the methods involved, and discuss the potential relevance of the fragment. (shrink)

We present the (Lascar) Galois group of any countable theory as a quotient of a compact Polish group by an F_σ normal subgroup: in general, as a topological group, and under NIP, also in terms of Borel cardinality. This allows us to obtain similar results for arbitrary strong types defined on a single complete type over ∅. As an easy conclusion of our main theorem, we get the main result of [K. Krupiński, A. Pillay and T. Rzepecki, Topological dynamics (...) and the complexity of strong types, Israel J. Math.228 (2018) 863–932] which says that for any strong type defined on a single complete type over ∅, smoothness is equivalent to type-definability. We also explain how similar results are obtained in the case of bounded quotients of type-definable groups. This gives us a generalization of a former result from the paper mentioned above about bounded quotients of type-definable subgroups of definable groups. (shrink)

We study the groups Gal L and Gal KP, and the associated equivalence relations EL and EKP, attached to a first order theory T. An example is given where EL≠ EKP. It is proved that EKP is the composition of EL and the closure of EL. Other examples are given showing this is best possible.

. The connection presented in this paper mirror-links two metamathematical structures, the finitary closure operators, and the compact consistency properties, in such a way that a specification of one structure induces a provably equivalent specification of the other.

The method based on the idea of Galois connection is well known. It facilitates investigations into similarities between mathematical structures, including isomorphisms between these structures, the highest degree of similarity. This idea is employed here and adapted so as to get to the core of aspects of the relationship between some metamathematical structures. The focus is put on the relation between traditional methodological orthodoxy based on the idea of proof , on the one hand, and on some alternative methodological (...) set-ups based on other ideas such as consistency or some forms of maximality, on the other hand. (shrink)

This paper presents a systematic investigation of fuzzy Galois connections in the sense of R. Bělohlávek [1], from the point of view of enriched category theory. The results obtained show that the theory of enriched categories makes it possible to present the theory of fuzzy Galois connections in a succinct way; and more importantly, it provides a useful method to express and to study the link and the difference between the commutative and the non-commutative worlds.

Intuitionistic propositional logic with Galois negations ( \(\mathsf {IGN}\) ) is introduced. Heyting algebras with Galois negations are obtained from Heyting algebras by adding the Galois pair \((\lnot,{\sim })\) and dual Galois pair \((\dot{\lnot },\dot{\sim })\) of negations. Discrete duality between GN-frames and algebras as well as the relational semantics for \(\mathsf {IGN}\) are developed. A Hilbert-style axiomatic system \(\mathsf {HN}\) is given for \(\mathsf {IGN}\), and Galois negation logics are defined as extensions of \(\mathsf (...) {IGN}\). We give the bi-tense logic \(\mathsf {S4N}_t\) which is obtained from the minimal tense extension of the modal logic \(\mathsf {S4}\) by adding tense operators. We give a new extended Gödel translation \(\tau \) and prove that \(\mathsf {IGN}\) is embedded into \(\mathsf {S4N}_t\) by \(\tau \). Moreover, every Kripke-complete Galois negation logic _L_ is embedded into its tense companion \(\tau (L)\). (shrink)

This paper is a continuation of investigations on Galois connections from [1], [3], [10]. It is a continuation of [2]. We have shown many results that link properties of a given closure space with that of the dual space. For example: for every -disjunctive closure space X the dual closure space is topological iff the base of X generated by this dual space consists of the -prime sets in X (Theorem 2). Moreover the characterizations of the satisfiability relation for (...) classical logic are shown. Roughly speaking our main result here is the following: a satisfiability relation in a logic L with, a countable language is a fragment of the classical one iff the compactness theorem for L holds (Theorems 3–8). (shrink)

Preface 1 Partially ordered sets 1.1 Posets introduced 1.2 Partial orders and strict orders 1.3 Maps between posets 1.4 Compounding maps 1.5 Order similarity 1.6 Inclusion posets as typical..

Apresentamos conceitos algébricos básicos e fundamentais como conjuntos ordenados, reticulados, álgebra de Boole e as TK-álgebras. Destacamos os espaços de Tarski, associados ao conceito de sistema dedutivo e sua apresentação quase topológica. Então, apresentamos a Lógica da Dedutibilidade, vinda da formalização lógica dos espaços de Tarski. A seguir, trazemos os pares de funções de Galois, que surgem em muitos tópicos da Matemática. Como resultado original, além de alguns desenvolvimentos teóricos, destacamos uma conexão de Galois com os espaços de (...) Tarski. (shrink)

Symmetric generalized Galois logics (i.e., symmetric gGl s) are distributive gGl s that include weak distributivity laws between some operations such as fusion and fission. Motivations for considering distribution between such operations include the provability of cut for binary consequence relations, abstract algebraic considerations and modeling linguistic phenomena in categorial grammars. We represent symmetric gGl s by models on topological relational structures. On the other hand, topological relational structures are realized by structures of symmetric gGl s. We generalize the (...) weak distributivity laws between fusion and fission to interactions of certain monotone operations within distributive super gGl s. We are able to prove appropriate generalizations of the previously obtained theorems—including a functorial duality result connecting classes of gGl s and classes of structures for them. (shrink)

Thomas Reid is now recognized as one of the towering figures of the Enlightenment. Best known for his published writings on epistemology and moral theory, he was also an accomplished mathematician and natural philosopher, as an earlier volume of his manuscripts edited by Paul Wood for the Edinburgh Reid Edition, Thomas Reid on the Animate Creation, has shown. The Correspondence of Thomas Reid collects all of the known letters to and from Reid in a fully annotated form. Letters already (...) published by Sir William Hamilton and others have been reedited, and roughly half of the letters included appear in print for the first time. Writing in 1802, Reid's disciple and biographer Dugald Stewart doubted that Reid's correspondence &"would be generally interesting.&" This collection proves otherwise, for the letters illuminate virtually every aspect of Reid's life and career and, in some instances, provide us with invaluable evidence about activities otherwise undocumented in his manuscripts or published works. Through his correspondence we can trace Reid's relations with contemporaries such as David Hume and his colleagues at both King's College, Aberdeen, and the University of Glasgow, as well as his engagement with the most controversial philosophical, scientific, and political issues of his day. If anything, the letters assembled here serve as the starting point for understanding Reid and his place in the Enlightenment. (shrink)

After Leibniz's death in 1716, Clarke published an edition of their philosophical correspondence--a wide-ranging discussion of the nature of God, human souls, free will and indifference of choice, space and time, the vacuum, miracles, and matter and force. Clarke included his own letters, his translations of Leibniz's letters, and some translated passages from Leibniz's French and Latin works that helped to illuminate their exchanges.

First, it is pointed out how the author's new differential Galois theory contributes to the understanding of the differential closure of an arbitrary differential field . Secondly, it is shown that a superstable differential field has no proper differential Galois extensions.

As a continuation of the work of the third author in [5], we make further observations on the features of Galois cohomology in the general model theoretic context. We make explicit the connection between forms of definable groups and first cohomology sets with coefficients in a suitable automorphism group. We then use a method of twisting cohomology (inspired by Serre’s algebraic twisting) to describe arbitrary fibres in cohomology sequences—yielding a useful “finiteness” result on cohomology sets. Applied to the special (...) case of differential fields and Kolchin’s constrained cohomology, we complete results from [3] by proving that the first constrained cohomology set of a differential algebraic group over a bounded, differentially large, field is countable. (shrink)

In this paper we introduce Hilbert algebras with Hilbert–Galois connections (HilGC-algebras) and we study the Hilbert–Galois connections defined in Heyting algebras, called HGC-algebras. We assign a categorical duality between the category HilGC-algebras with Hilbert homomorphisms that commutes with Hilbert–Galois connections and Hilbert spaces with certain binary relations and whose morphisms are special functional relations. We also prove a categorical duality between the category of Heyting Galois algebras with Heyting homomorphisms that commutes with Hilbert–Galois connections and (...) the category of spectral Heyting spaces endowed with a binary relation with certain special continuous maps. (shrink)