Decision problems concerning properties of finite sets of equations

1986 ◽  
Vol 51 (1) ◽  
pp. 79-87 ◽  
Author(s):  
Cornelia Kalfa
Keyword(s):  
Order Theory ◽  
List Type ◽  
Finite Sets ◽  
Operation Symbol ◽  
First Order ◽  
First Order Theory ◽  
Rank One ◽  
Joint Embedding ◽  
Algebraic Language ◽  
Joint Embedding Property

In this paper a general method of proving the undecidability of a property P, for finite sets Σ of equations of a countable algebraic language, is presented. The method is subsequently applied to establish the undecidability of the following properties, in almost all nontrivial such languages:1. The first-order theory generated by the infinite models of Σ is complete.2. The first-order theory generated by the infinite models of Σ is model-complete.3. Σ has the joint-embedding property.4. The first-order theory generated by the models of Σ with more than one element has the joint-embedding property.5. The first-order theory generated by the infinite models of Σ has the joint-embedding property.A countable algebraic language ℒ is a first-order language with equality, with countably many nonlogical symbols but without relation symbols, ℒ is trivial if it has at most one operation symbol, and this is of rank one. Otherwise, ℒ is nontrivial. An ℒ-equation is a sentence of the form , where φ and ψ are ℒ-terms. The set of ℒ-equations is denoted by Eqℒ. A set of sentences is said to have the joint-embedding property if any two models of it are embeddable in a third model of it.If P is a property of sets of ℒ-equations, the decision problem of P for finite sets of ℒ-equations is the problem of the existence or not of an algorithm for deciding whether, given a finite Σ ⊂ Eqℒ, Σ has P or not.

Decidable properties of finite sets of equations in trivial languages

1984 ◽  
Vol 49 (4) ◽  
pp. 1333-1338
Author(s):  
Cornelia Kalfa
Keyword(s):  
Equational Theory ◽  
Order Theory ◽  
Operation Symbol ◽  
First Order ◽  
First Order Theory ◽  
Order Language ◽  
Finite Set ◽  
Joint Embedding ◽  
Algebraic Language ◽  
Joint Embedding Property

In [4] I proved that in any nontrivial algebraic language there are no algorithms which enable us to decide whether a given finite set of equations Σ has each of the following properties except P2 (for which the problem is open):P0(Σ) = the equational theory of Σ is equationally complete.P1(Σ) = the first-order theory of Σ is complete.P2(Σ) = the first-order theory of Σ is model-complete.P3(Σ) = the first-order theory of the infinite models of Σ is complete.P4(Σ) = the first-order theory of the infinite models of Σ is model-complete.P5(Σ) = Σ has the joint embedding property.In this paper I prove that, in any finite trivial algebraic language, such algorithms exist for all the above Pi's. I make use of Ehrenfeucht's result [2]: The first-order theory generated by the logical axioms of any trivial algebraic language is decidable. The results proved here are part of my Ph.D. thesis [3]. I thank Wilfrid Hodges, who supervised it.Throughout the paper is a finite trivial algebraic language, i.e. a first-order language with equality, with one operation symbol f of rank 1 and at most finitely many constant symbols.

scholarly journals An Invitation to Model-Theoretic Galois Theory

2010 ◽  
Vol 16 (2) ◽  
pp. 261-269 ◽  
Author(s):  
Alice Medvedev ◽  
Ramin Takloo-Bighash
Keyword(s):  
Galois Group ◽  
Galois Theory ◽  
Order Theory ◽  
Closed Field ◽  
Finite Sets ◽  
Algebraically Closed Field ◽  
First Order ◽  
First Order Theory ◽  
Special Case ◽  
Large Model

AbstractWe carry out some of Galois' work in the setting of an arbitrary first-order theory T. We replace the ambient algebraically closed field by a large model M of T, replace fields by definably closed subsets of M, assume that T codes finite sets, and obtain the fundamental duality of Galois theory matching subgroups of the Galois group of L over F with intermediate extensions F ≤ K ≤ L. This exposition of a special case of [10] has the advantage of requiring almost no background beyond familiarity with fields, polynomials, first-order formulae, and automorphisms.

Boolean sentence algebras: Isomorphism constructions

1983 ◽  
Vol 48 (2) ◽  
pp. 329-338 ◽  
Author(s):  
William P. Hanf ◽  
Dale Myers
Keyword(s):  
Unary Operation ◽  
Order Theory ◽  
Bernstein Theorem ◽  
Operation Symbol ◽  
Relation Symbol ◽  
Boolean Space ◽  
First Order ◽  
First Order Theory ◽  
Continuous Maps ◽  
Model Spaces

AbstractAssociated with each first-order theory is a Boolean algebra of sentences and a Boolean space of models. Homomorphisms between the sentence algebras correspond to continuous maps between the model spaces. To what do recursive homomorphisms correspond? We introduce axiomatizable maps as the appropriate dual. For these maps we prove a Cantor-Bernstein theorem. Duality and the Cantor-Bernstein theorem are used to show that the Boolean sentence algebras of any two undecidable languages or of any two functional languages are recursively isomorphic where a language is undecidable iff it has at least one operation or relation symbol of two or more places or at least two unary operation symbols, and a language is functional iff it has exactly one unary operation symbol and all other symbols are for unary relations, constants, or propositions.

scholarly journals A first-order theory of Ulm type

Computability ◽  
2019 ◽  
Vol 8 (3-4) ◽  
pp. 347-358
Author(s):  
Matthew Harrison-Trainor
Keyword(s):  
Order Theory ◽  
First Order ◽  
First Order Theory

scholarly journals Quasi-decidability of a Fragment of the First-Order Theory of Real Numbers

2015 ◽  
Vol 57 (2) ◽  
pp. 157-185 ◽  
Author(s):  
Peter Franek ◽  
Stefan Ratschan ◽  
Piotr Zgliczynski
Keyword(s):  
Order Theory ◽  
Real Numbers ◽  
First Order ◽  
First Order Theory
Sign in / Sign up

Export Citation Format

Share Document