Pages that link to "Item:Q3274971"
From MaRDI portal
The following pages link to An application of games to the completeness problem for formalized theories (Q3274971):
Displaying 50 items.
- One unary function says less than two in existential second order logic (Q286970) (← links)
- Generalized hex and logical characterizations of polynomial space (Q287159) (← links)
- Universal zero-one \(k\)-law (Q325661) (← links)
- Automatic models of first order theories (Q387121) (← links)
- Solutions and query rewriting in data exchange (Q388220) (← links)
- Continuous time temporal logic with counting (Q418179) (← links)
- The Banach spaces \(l_ p(n)\) for large p and n (Q584692) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- On complexity of Ehrenfeucht-Fraïssé games (Q636279) (← links)
- On the expressive power of counting (Q672336) (← links)
- Finite-model theory -- A personal perspective (Q688663) (← links)
- Inherent complexity of recursive queries (Q696953) (← links)
- Star-free languages are Church-Rosser congruential (Q714818) (← links)
- Classifying \(\aleph_ 0\)-categorical theories (Q752693) (← links)
- A representation theorem for languages with generalized quantifiers through back-and-forth methods (Q752702) (← links)
- On simplicity of formulas (Q757354) (← links)
- Calculus with the quantifier of elementary equivalence (Q791519) (← links)
- Invariance under stuttering in a temporal logic of actions (Q859839) (← links)
- Computational complexity of logical theories of one successor and another unary function (Q868664) (← links)
- An Ehrenfeucht-Fraïssé game approach to collapse results in database theory (Q870360) (← links)
- Parametrization over inductive relations of a bounded number of variables (Q917545) (← links)
- Definability with bounded number of bound variables (Q922523) (← links)
- When is arithmetic possible? (Q922533) (← links)
- Model theory of the regularity and reflection schemes (Q938239) (← links)
- On quantifier-rank equivalence between linear orders (Q964492) (← links)
- Decidable metric logics (Q999264) (← links)
- Dialogue games for many-valued logics -- an overview (Q1005947) (← links)
- The Craig interpolation theorem in abstract model theory (Q1024119) (← links)
- Turing machine computations in finitely axiomatizable theories (Q1059628) (← links)
- On the computational complexity of the theory of Abelian groups (Q1100188) (← links)
- The expressive power of Malitz quantifiers for linear orderings (Q1105586) (← links)
- Complexity of Boolean algebras (Q1137036) (← links)
- The Boolean algebra of the theory of linear orders (Q1141142) (← links)
- Definability in dynamic logic (Q1158140) (← links)
- Number of quantifiers is better than number of tape cells (Q1164622) (← links)
- Partial isomorphisms and intuitionistic logic (Q1170233) (← links)
- Some undecidable determined games (Q1171511) (← links)
- Upper and lower bounds for first order expressibility (Q1173404) (← links)
- Classifying regular events in symbolic logic (Q1173413) (← links)
- The invariant problem for binary string structures and the parallel complexity theory of queries (Q1191022) (← links)
- The quantifier structure of sentences that characterize nondeterministic time complexity (Q1198956) (← links)
- Games, equations and dot-depth two monoids (Q1201097) (← links)
- An optimal lower bound on the number of variables for graph identification (Q1204528) (← links)
- Minimal models of theories of one function symbol (Q1214413) (← links)
- Theories of linear order (Q1216299) (← links)
- Elementary equivalence and relatively free products of lattices (Q1247344) (← links)
- On winning strategies in Ehrenfeucht-Fraïssé games (Q1269907) (← links)
- Trees, congruences and varieties of finite semigroups (Q1270818) (← links)
- How to win a game with features (Q1271569) (← links)
- Algebras for querying text regions: Expressive power and optimization (Q1278037) (← links)
