The following pages link to (Q3220545):
Displaying 50 items.
- Projection and scope-determined circumscription (Q429594) (← links)
- On expressive power of basic modal intuitionistic logic as a fragment of classical FOL (Q518747) (← links)
- Observation equivalence as a testing equivalence (Q580965) (← links)
- Algorithmic uses of the Feferman-Vaught theorem (Q598280) (← links)
- The quasi-lattice of indiscernible elements (Q631517) (← links)
- A note on the number of monadic quantifiers in monadic \(\Sigma ^{1}_{1}\) (Q673910) (← links)
- The structure of the models of decidable monadic theories of graphs (Q810005) (← links)
- Initial failures in distributed computations (Q915424) (← links)
- Parametrization over inductive relations of a bounded number of variables (Q917545) (← links)
- Closed world assumptions having precedence in predicates (Q922726) (← links)
- On the complexity of theories of permutations (Q1088647) (← links)
- Substitution revisited (Q1106190) (← links)
- Incompleteness of first-order temporal logic with until (Q1123184) (← links)
- How to win a game with features (Q1271569) (← links)
- On a complete set of generators for dot-depth two (Q1324687) (← links)
- Modulo-counting quantifiers over finite trees (Q1325850) (← links)
- Listing graphs that satisfy first-order sentences (Q1337473) (← links)
- On elementary equivalence for equality-free logic (Q1355131) (← links)
- Model-theoretical foundation of action and progression (Q1373857) (← links)
- Finitely representable databases (Q1376408) (← links)
- Specification of abstract dynamic-data types: A temporal logic approach (Q1391733) (← links)
- The modal argument for hypercomputing minds (Q1434374) (← links)
- Quantified constraints under perturbation (Q1600045) (← links)
- Back-and-forth systems for fuzzy first-order models (Q1795203) (← links)
- The correctness of nondeterministic programs revisited (Q1819925) (← links)
- Abstract state machines and computationally complete query languages (Q1854519) (← links)
- Possibility and impossibility results in a shared memory environment (Q1901689) (← links)
- A first-order axiomatization of the theory of finite trees (Q1903080) (← links)
- Back-and-forth for systems of antichains (Q1904385) (← links)
- Atomic ontology (Q2054007) (← links)
- A survey of nonstandard sequent calculi (Q2259014) (← links)
- An algebraic approach to belief contraction and nonmonotonic entailment (Q2372198) (← links)
- On fork arrow logic and its expressive power (Q2454871) (← links)
- Large finite structures with few \(L^k\)-types (Q2506492) (← links)
- Zero-place operations and functional completeness, and the definition of new connectives (Q3141184) (← links)
- The mu-calculus and Model Checking (Q3176384) (← links)
- Expressive Power and Decidability for Memory Logics (Q3511448) (← links)
- Quantified Constraint Satisfaction and the Polynomially Generated Powers Property (Q3519502) (← links)
- Foundations of a theorem prover for functional and mathematical uses (Q4275695) (← links)
- Star-free picture expressions are strictly weaker than first-order logic (Q4571966) (← links)
- Finite Automata Over Infinite Alphabets: Two Models with Transitions for Local Change (Q4640038) (← links)
- Is Universal Computation a Myth? (Q4686642) (← links)
- A refutation of Penrose's Gödelian case against artificial intelligence (Q4784280) (← links)
- On the Ehrenfeucht-Fraïssé game in theoretical computer science (Q5044763) (← links)
- How to win a game with features (Q5096316) (← links)
- First-order logic on finite trees (Q5096727) (← links)
- Recursive Definitions and Fixed-Points (Q5178958) (← links)
- Dialectical Contradictions and Classical Formal Logic (Q5250259) (← links)
- An open formalism against incompleteness (Q5937853) (← links)
- The generic filter property in nonstandard analysis (Q5942882) (← links)
