Elementary induction on abstract structures
From MaRDI portal
Publication:1217684
zbMath0307.02003MaRDI QIDQ1217684
Publication date: 1974
Published in: Studies in Logic and the Foundations of Mathematics (Search for Journal in Brave)
Model theory (03C99) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Hierarchies of computability and definability (03D55)
Related Items (only showing first 100 items - show all)
Differential Game Logic ⋮ On revision operators ⋮ On asymptotic probabilities in logics that capture DSPACE(log n) in presence of ordering ⋮ RATIONAL DYNAMICS AND EPISTEMIC LOGIC IN GAMES ⋮ On the Performance of Axiom Systems ⋮ The mu-calculus and Model Checking ⋮ $\aleph_1$ and the modal $\mu$-calculus ⋮ Inductive definitions over finite structures ⋮ A domain equation for bisimulation ⋮ Infinitary queries and their asymptotic probabilities. II. Properties definable in least fixed point logic ⋮ How to develop Proof‐Theoretic Ordinal Functions on the basis of admissible ordinals ⋮ Recursively Saturated Models of Set Theory ⋮ A Note On Analytic Sets ⋮ ABOUT SOME FIXED POINT AXIOMS AND RELATED PRINCIPLES IN KRIPKE–PLATEK ENVIRONMENTS ⋮ Unnamed Item ⋮ Existential Fixed-Point Logic as a Fragment of Second-Order Logic ⋮ A query language for NC (extended abstract) ⋮ Systems for non-reflexive consequence ⋮ Unnamed Item ⋮ ERRATUM: "RATIONAL DYNAMICS AND EPISTEMIC LOGIC IN GAMES" ⋮ Locally hyperarithmetical induction ⋮ Dimension Versus Number of Variables, and Connectivity, too ⋮ Truth meets vagueness. Unifying the semantic and the soritical paradoxes ⋮ Bicontextualism ⋮ Classes of Polish spaces under effective Borel isomorphism ⋮ Intrinsically II Relations ⋮ Enumeration Reducibility and Computable Structure Theory ⋮ Infinitary action logic with multiplexing ⋮ A few more dissimilarities between second-order arithmetic and set theory ⋮ Intrinsically Hyperarithmetical Sets ⋮ A UNIFIED THEORY OF TRUTH AND PARADOX ⋮ Computing on structures ⋮ More on Systems of Truth and Predicative Comprehension ⋮ Hyperarithmetical Sets ⋮ About Truth and Types ⋮ From Subsystems of Analysis to Subsystems of Set Theory ⋮ From Mathesis Universalis to Fixed Points and Related Set-Theoretic Concepts ⋮ A restricted second order logic for finite structures ⋮ The modal mu-calculus alternation hierarchy is strict ⋮ ULTIMATE TRUTHVIS-À-VISSTABLE TRUTH ⋮ On monotone vs. nonmonotone induction ⋮ Some model theory for monotone quantifiers ⋮ On Gupta-Belnap Revision Theories of Truth, Kripkean Fixed Points, and The Next Stable Set ⋮ Recursion in a quantifier vs. elementary induction ⋮ One Useful Logic That Defines Its Own Truth ⋮ On the theory of Π₃¹ sets of reals ⋮ TRUTHS, INDUCTIVE DEFINITIONS, AND KRIPKE-PLATEK SYSTEMS OVER SET THEORY ⋮ Infinitary logic for computer science ⋮ Borel extractions of converging sequences in compact sets of Borel functions ⋮ THE RAMIFIED ANALYTICAL HIERARCHY USING EXTENDED LOGICS ⋮ Feferman on Computability ⋮ Iterated Inductive Definitions Revisited ⋮ ON EQUATIONS OVER SETS OF NUMBERS AND THEIR LIMITATIONS ⋮ Determined admissible sets ⋮ INEFFABILITY AND REVENGE ⋮ Conservative Extensions of Abstract Structures ⋮ Ordinal spectra of first-order theories ⋮ The Theory of Countable Analytical Sets ⋮ Beitrag zur algebraischen Rekursionstheorie ⋮ Games for Truth ⋮ Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines ⋮ Extensions of countable infinitary logic which preserve most of its nice properties ⋮ THE MODAL LOGICS OF KRIPKE–FEFERMAN TRUTH ⋮ Logic and Game Theory ⋮ The extent of definable scales ⋮ GAMES AND REFLECTION IN ⋮ The Limits of Predicativity Revisited ⋮ INFINITARY TABLEAU FOR SEMANTIC TRUTH ⋮ SHORTENING CLOPEN GAMES ⋮ Degree spectra of relations on computable structures in the presence of Δ20isomorphisms ⋮ One hundred years of semantic paradox ⋮ A contextual-hierarchical approach to truth and the liar paradox ⋮ Stratified least fixpoint logic ⋮ De Finettian logics of indicative conditionals. II: Proof theory and algebraic semantics ⋮ What is so special with the powerset operation? ⋮ Expressive equivalence of least and inflationary fixed-point logic ⋮ Fixed-point extensions of first-order logic ⋮ First-order theories for pure Prolog programs with negation ⋮ Truth, dependence and supervaluation: living with the ghost ⋮ Implication and analysis in classical Frege structures ⋮ Generalized quantifiers and pebble games on finite structures ⋮ Formalizing non-termination of recursive programs ⋮ Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts ⋮ A unified approach to semantic and soritical paradoxes ⋮ Adding a conditional to Kripke's theory of truth ⋮ Inner constructivizability of functional structures ⋮ The computational complexity of asymptotic problems. I: Partial orders ⋮ How to define a linear order on finite models ⋮ Generalized hyperarithmetical computability over structures ⋮ Computational inductive definability ⋮ A query language for NC ⋮ Hierarchies in transitive closure logic, stratified Datalog and infinitary logic ⋮ The \(\mu\)-calculus as an assertion-language for fairness arguments ⋮ FO(ID) as an extension of DL with rules ⋮ Definability in the structure of words with the inclusion relation ⋮ Non-terminating processes in the situation calculus ⋮ Revision without revision sequences: circular definitions ⋮ Rethinking revision ⋮ Epsilon substitution method for \(\text{ID}_{1}(\Pi_{1}^{0}\vee{\Sigma} _{1}^{0})\) ⋮ A Buchholz rule for modal fixed point logics
This page was built for publication: Elementary induction on abstract structures
