Using resolution for deciding solvable classes and building finite models

2005 ◽  
pp. 33-64 ◽  
Author(s):  
Tanel Tammet
Keyword(s):  
Finite Models

Applications of Finite Models Properties in Approximation and Algorithmic Logics

1991 ◽  
Vol 14 (1) ◽  
pp. 91-108
Author(s):  
Jarosław Stepaniuk
Keyword(s):  
Finite Models ◽  
Elementary Theories

The purpose of this paper is to investigate some aspects concerning elementary theories of finite models and to give the applications in approximation logics and algorithmic theory of dictionaries.

THE ANNIHILATING IDEALS OF MINIMAL MODELS

1992 ◽  
Vol 07 (supp01a) ◽  
pp. 217-238 ◽  
Author(s):  
BORIS L. FEIGIN ◽  
TOMOKI NAKANISHI ◽  
HIROSI OOGURI
Keyword(s):  
Central Charge ◽  
Field Theories ◽  
Conformal Field Theories ◽  
Minimal Models ◽  
Finite Models ◽  
Conformal Field ◽  
Intimate Relation ◽  
Chiral Algebras

We describe several aspects of the annihilating ideals and reduced chiral algebras of conformal field theories, especially, minimal models of Wn algebras. The structure of the annihilating ideal and a vanishing condition is given. Using the annihilating ideal, the structure of quasi-finite models of the Virasoro (2,q) minimal models are studied, and their intimate relation to the Gordon identities are discussed. We also show the examples in which the reduced algebras of Wn and Wℓ algebras at the same central charge are isomorphic to each other.

External automorphisms of ultraproducts of finite models

2012 ◽  
Vol 51 (3-4) ◽  
pp. 433-441
Author(s):  
Philipp Lücke ◽  
Saharon Shelah
Keyword(s):  
Finite Models

On the elementary equivalence of automorphism groups of Boolean algebras; downward Skolem Löwenheim theorems and compactness of related quantifiers

1980 ◽  
Vol 45 (2) ◽  
pp. 265-283 ◽  
Author(s):  
Matatyahu Rubin ◽  
Saharon Shelah
Keyword(s):  
Boolean Algebra ◽  
Automorphism Groups ◽  
Order Logic ◽  
Boolean Algebras ◽  
First Order Logic ◽  
Elementary Equivalence ◽  
First Order ◽  
Finite Models ◽  
Countably Compact

AbstractTheorem 1. (◊ℵ1,) If B is an infinite Boolean algebra (BA), then there is B1, such that ∣ Aut (B1) ≤∣B1∣ = ℵ1 and 〈B1, Aut (B1)〉 ≡ 〈B, Aut(B)〉.Theorem 2. (◊ℵ1) There is a countably compact logic stronger than first-order logic even on finite models.This partially answers a question of H. Friedman. These theorems appear in §§1 and 2.Theorem 3. (a) (◊ℵ1) If B is an atomic ℵ-saturated infinite BA, Ψ Є Lω1ω and 〈B, Aut (B)〉 ⊨Ψ then there is B1, Such that ∣Aut(B1)∣ ≤ ∣B1∣ =ℵ1, and 〈B1, Aut(B1)〉⊨Ψ. In particular if B is 1-homogeneous so is B1. (b) (a) holds for B = P(ω) even if we assume only CH.

The logic of informational independence and finite models

1997 ◽  
Vol 5 (1) ◽  
pp. 79-95 ◽  
Author(s):  
G Sandu
Keyword(s):  
Finite Models

scholarly journals Finite models and finitely many variables

1999 ◽  
Vol 46 (1) ◽  
pp. 93-117 ◽  
Author(s):  
Anuj Dawar
Keyword(s):  
Finite Models

On first-order sentences without finite models

2004 ◽  
Vol 69 (2) ◽  
pp. 329-339 ◽  
Author(s):  
Marko Djordjević
Keyword(s):  
Binary Relation ◽  
Function Symbol ◽  
Complete Theory ◽  
Order Property ◽  
Unary Function ◽  
First Order ◽  
Finite Models

We will mainly be concerned with a result which refutes a stronger variant of a conjecture of Macpherson about finitely axiomatizable ω-categorical theories. Then we prove a result which implies that the ω-categorical stable pseudoplanes of Hrushovski do not have the finite submodel property.Let's call a consistent first-order sentence without finite models an axiom of infinity. Can we somehow describe the axioms of infinity? Two standard examples are:ϕ1: A first-order sentence which expresses that a binary relation < on a nonempty universe is transitive and irreflexive and that for every x there is y such that x < y.ϕ2: A first-order sentence which expresses that there is a unique x such that, (0) for every y, s(y) ≠ x (where s is a unary function symbol),and, for every x, if x does not satisfy (0) then there is a unique y such that s(y) = x.Every complete theory T such that ϕ1 ϵ T has the strict order property (as defined in [10]), since the formula x < y will have the strict order property for T. Let's say that if Ψ is an axiom of infinity and every complete theory T with Ψ ϵ T has the strict order property, then Ψ has the strict order property.Every complete theory T such that ϕ2 ϵ T is not ω-categorical. This is the case because a complete theory T without finite models is ω-categorical if and only if, for every 0 < n < ω, there are only finitely many formulas in the variables x1,…,xn, up to equivalence, in any model of T.

Sign in / Sign up

Export Citation Format

Share Document