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.
- Arity bounds in first-order incremental evaluation and definition of polynomial time database queries (Q1278038) (← links)
- Expressibility of output equals input. Negative and positive results (Q1323378) (← links)
- Modulo-counting quantifiers over finite trees (Q1325850) (← links)
- Finitely representable databases (Q1376408) (← links)
- Ehrenfeucht games and ordinal addition (Q1377635) (← links)
- Queries with arithmetical constraints (Q1391932) (← links)
- Local properties of query languages (Q1575140) (← links)
- The closure of monadic NP (Q1577017) (← links)
- Logic over words on denumerable ordinals (Q1604197) (← links)
- Finite information logic (Q1779313) (← links)
- Back-and-forth systems for fuzzy first-order models (Q1795203) (← links)
- A technique for proving decidability of containment and equivalence of linear constraint queries (Q1807671) (← links)
- Games, equations and the dot-depth hierarchy (Q1823928) (← links)
- Structure and complexity of relational queries (Q1838840) (← links)
- An until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic (Q1854353) (← links)
- Star-free sets of words on ordinals (Q1854423) (← links)
- An infinite hierarchy of temporal logics over branching time (Q1854487) (← links)
- Representation-finite triangular algebras form an open scheme (Q1856358) (← links)
- Shrinking games and local formulas (Q1877096) (← links)
- Future temporal logic needs infinitely many modalities (Q1877549) (← links)
- Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames (Q1908859) (← links)
- Hierarchies in transitive closure logic, stratified Datalog and infinitary logic (Q1919531) (← links)
- On winning Ehrenfeucht games and monadic NP (Q1919539) (← links)
- The metric linear-time branching-time spectrum on nondeterministic probabilistic processes (Q1989321) (← links)
- On the expressive power of hybrid branching-time logics (Q1989342) (← links)
- Synthesis of quantifier-free DNF sentences from inconsistent samples of strings with EF games and SAT (Q2003999) (← links)
- Zero-one laws for random \(k\)-partite graphs (Q2077282) (← links)
- A logic-based approach to incremental reasoning on multi-agent systems (Q2089459) (← links)
- A pebbling comonad for finite rank and variable logic, and an application to the equirank-variable homomorphism preservation theorem (Q2133477) (← links)
- Expressive power and succinctness of the positive calculus of binary relations (Q2141281) (← links)
- Model theory of monadic predicate logic with the infinity quantifier (Q2144617) (← links)
- Small model property reflects in games and automata (Q2151424) (← links)
- Computing branching distances with quantitative games (Q2210522) (← links)
- On limit points of spectra of first-order sentences with quantifier depth 4 (Q2211264) (← links)
- Synthesis of a DNF formula from a sample of strings using Ehrenfeucht-Fraïssé games (Q2285664) (← links)
- A.D. Taimanov and model theory in Kazakhstan (Q2306026) (← links)
- Infinite spectra of first-order properties for random hypergraphs (Q2314159) (← links)
- On distinguishing sets of structures by first-order sentences of minimal quantifier rank (Q2333677) (← links)
- On the zero-one 4-law for the Erdős-Rényi random graphs (Q2353728) (← links)
- Succinct definitions in the first order theory of graphs (Q2368907) (← links)
- Monadic second-order properties of very sparse random graphs (Q2404656) (← links)
- The quantitative linear-time-branching-time spectrum (Q2453109) (← links)
- Decomposable graphs and definitions with no quantifier alternation (Q2461780) (← links)
- \(\text{BTL}_{2}\) and the expressive power of \(\text{ECTL}^{+}\) (Q2500472) (← links)
- Tree acceptors and some of their applications (Q2544414) (← links)
- Elementary properties of semigroups of transformations of ordered sets (Q2550843) (← links)
- Categorical theories of a function (Q2553358) (← links)
- A generalization of Ehrenfeucht's game and some applications (Q2557698) (← links)
- The first order definability of graphs with separators via the Ehrenfeucht game (Q2570131) (← links)
- Ehrenfeucht-Fraïssé games on ordinals (Q2636521) (← links)
