Pages that link to "Item:Q1217684"

The following pages link to Elementary induction on abstract structures (Q1217684):

Displaying 50 items.

• One hundred years of semantic paradox (Q266649) (← links)
• A disquotational theory of truth as strong as \(Z_2^-\) (Q496323) (← links)
• Notes on the computational aspects of Kripke's theory of truth (Q526739) (← links)
• Decidable containment of recursive queries (Q555766) (← links)
• Decidability and definability with circumscription (Q579240) (← links)
• Computational inductive definability (Q598276) (← links)
• FO(ID) as an extension of DL with rules (Q604911) (← links)
• Definability in the structure of words with the inclusion relation (Q606049) (← links)
• On the logic of UNITY (Q673960) (← links)
• Tarskian and Kripkean truth (Q676185) (← links)
• On the equivalence of recursive and nonrecursive Datalog programs (Q676421) (← links)
• The analytical completeness of Dzhaparidze's polymodal logics (Q685073) (← links)
• Gurevich-Harrington's games defined by finite automata (Q685082) (← links)
• The alternating fixpoint of logic programs with negation (Q686646) (← links)
• A closed-form evaluation for Datalog queries with integer (gap)-order constraints (Q688670) (← links)
• Representing hyper-arithmetical sets by equations over sets of integers (Q693054) (← links)
• Some notes on truths and comprehension (Q722023) (← links)
• Principles for object-linguistic consequence: from logical to irreflexive (Q722029) (← links)
• Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies (Q752703) (← links)
• Paradox, truth and logic. I. Paradox and truth (Q798312) (← links)
• Four valued semantics and the Liar (Q798313) (← links)
• The expressive power of stratified logic programs (Q803773) (← links)
• What truth depends on (Q815014) (← links)
• Comparing inductive and circular definitions: Parameters, complexity and games (Q817681) (← links)
• De Finettian logics of indicative conditionals. II: Proof theory and algebraic semantics (Q830363) (← links)
• A logic of abstraction related to finite constructive number classes (Q910401) (← links)
• A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
• Parametrization over inductive relations of a bounded number of variables (Q917545) (← links)
• When is arithmetic possible? (Q922533) (← links)
• Canonical completeness of infinitary \(\mu \) (Q941442) (← links)
• Ł\(\Pi\) logic with fixed points (Q953281) (← links)
• Ordinal analysis of non-monotone \(\Pi_1^0\)-definable inductive definitions (Q958493) (← links)
• Inessential features, ineliminable features, and modal logics for model theoretic syntax (Q1006492) (← links)
• The metamathematics of ergodic theory (Q1006602) (← links)
• Inductive situation calculus (Q1028914) (← links)
• Supervaluation fixed-point logics of truth (Q1029817) (← links)
• Grounding, dependence, and paradox (Q1054718) (← links)
• How truthlike can a predicate be? A negative result (Q1069920) (← links)
• Fixed-point extensions of first-order logic (Q1090327) (← links)
• Implication and analysis in classical Frege structures (Q1095139) (← links)
• The computational complexity of asymptotic problems. I: Partial orders (Q1115860) (← links)
• The \(\mu\)-calculus as an assertion-language for fairness arguments (Q1124314) (← links)
• Recursion over realizability structures (Q1173956) (← links)
• Why not negation by fixpoint? (Q1176286) (← links)
• Boundedness theorems for dilators and ptykes (Q1177037) (← links)
• An analysis of fixed-point queries on binary trees (Q1183571) (← links)
• The functional dimension of inductive definitions (Q1193414) (← links)
• Infinitary logics and 0-1 laws (Q1193591) (← links)
• Query languages for hierarchic databases (Q1201723) (← links)
• Fixed points in Peano arithmetic with ordinals (Q1210139) (← links)