Publication:4075450
From MaRDI portal
zbMath0316.02047MaRDI QIDQ4075450
Publication date: 1975
03C99: Model theory
03-02: Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations
03E55: Large cardinals
03C75: Other infinitary logic
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
Related Items
Decidability and definability with circumscription, Refusal testing, Computational inductive definability, Computing with infinitary logic, Operational set theory and small large cardinals, Each family of subsets of the urelements generates an admissible set, Isomorphic incidence algebras, Countably decomposable admissible sets, Model theory for \(L_{\infty \omega _ 1}\), Iterating ordinal definability, On conceptual completeness of syntactic-semantical systems, Hierarchies of program logics, Proof-theoretic analysis of KPM, Generalizing classical and effective model theory in theories of operations and classes, Principal numerations of functionals on admissible sets, Comparing inductive and circular definitions: Parameters, complexity and games, Completeness theorem for topological class models, A logic of abstraction related to finite constructive number classes, Canonical completeness of infinitary \(\mu \), Countable structures \(\Sigma \)-definable over classical continuous number systems, Partial automorphism semigroups, Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems, The strength of extensionality. I: Weak weak set theories with infinity, Patterns of resemblance of order 2, The many faces of interpolation, The Craig interpolation theorem in abstract model theory, Uncountable admissibles. II: Compactness, Probability logic with conditional expectation, A constructive consistency proof of a fragment of set theory, The limits of E-recursive enumerability, A universal recursive function on admissible sets, Admissibility spectra through \(\omega _ 1\), Another extension of Van de Wiele's theorem, Playing with admissibility spectra, Admissibility spectra and minimality, Applications of Fodor's lemma to Vaught's conjecture, Generatability of admissible sets, The Galvin-Prikry theorem and set existence axioms, Existence of an inseparable pair in the recursive theory of admissible sets, Descriptive characterizations of computational complexity, Bilattices and the theory of truth, Sacks forcing does not always produce a minimal upper bound, Partial isomorphisms and intuitionistic logic, The complexity of antidifferentiation, An algebraic treatment of the Barwise compactness theory, On the effective content of asymptotic verifications of Edgeworth's Conjecture, Hypersets, Automorphisms of recursively saturated models of arithmetic, Large cardinals and iteration trees of height \(\omega\), Algebraization of quantifier logics, an introductory overview, Effective oracles, Forcing in admissible sets, A slight strengthening of a theorem of Blair and Kunen, Query languages for hierarchic databases, Some applications of Henkin quantifiers, New axiomatizations for logics with generalized quantifiers, Modal languages and bounded fragments of predicate logic, The modal mu-calculus alternation hierarchy is strict, Strong \(\Delta_1\)-definability of a model in an admissible set, Borel equivalence relations induced by actions of the symmetric group, Well-ordering proofs for Martin-Löf type theory, In conjunction with qualitative probability, Hereditarily-finite sets, data bases and polynomial-time computability, Admissible sets in group theory, Collapsing functions based on recursively large ordinals: A well-ordering proof for KPM, Induction and foundation in the theory of hereditarily finite sets, Stratified least fixpoint logic, Proof theory of reflection, Non-well-founded sets via revision rules, The strength of some Martin-Löf type theories, Issues in commonsense set theory, Toward a generalized computability theory, On the proof-theoretic strength of monotone induction in explicit mathematics, HYPERSOLVER: A graphical tool for commonsense set theory, An algebraic theory of structured objects, \(\Delta\)-languages for sets and LOGSPACE computable graph transformers, Semantics for finite delay, Proof theory for theories of ordinals. I: Recursively Mahlo ordinals, Functional interpretation of Aczel's constructive set theory, Generalized logical consequence: Making room for induction in the logic of science, An ordinal analysis of stability, An ordinal analysis of parameter free \(\Pi^{1}_{2}\)-comprehension, Models of set theory with definable ordinals, Possible-worlds semantics for modal notions conceived as predicates, \(\Sigma\)-predicates of finite types over an admissible set, Ptykes in Gödels T und Definierbarkeit von Ordinalzahlen. (Ptykes in Gödel's T and definability of ordinal numbers), On natural number objects, finiteness and Kripke-Platek models in toposes, Skolem redux, Universes over Frege structures, A contextual-hierarchical approach to truth and the liar paradox, The real core model and its scales, Levels of truth, Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones, Categoricity of finitely generated algebraic systems in HF-logic, Normal forms for second-order logic over finite structures, and classification of NP optimization problems, Complexity and undecidability results for logic programming, Linear ordering on graphs, anti-founded sets and polynomial time computability, Proof theory and ordinal analysis, Bounding lemmata for non-deterministic halting times of transfinite Turing machines, On the relationship between fixed points and iteration in admissible set theory without foundation, Reflection of Long Game Formulas, From compositional to systematic semantics, Polish group actions: Dichotomies and generalized elementary embeddings, Polish Group Actions and the Vaught Conjecture, The completeness of the isomorphism relation for countable Boolean algebras, A Π¹₁-uniformization principle for reals, Index sets for classes of high rank structures, Elementary patterns of resemblance, Forcing closed unbounded subsets of \(\omega_2\), The strength of Mac Lane set theory, Logical problems of functional interpretations, Borel equivalence relations and classifications of countable models, Levy and set theory, Expressivity of second order propositional modal logic, Characterizing the interpretation of set theory in Martin-Löf type theory, A modal proof theory for final polynomial coalgebras, Recursive programs and denotational semantics in absolute logics of programs, Bounds on Scott rank for various nonelementary classes, Varieties of complex algebras, Explicit descriptions of injective envelopes: generalizations of a result of northcott, On revision operators, Definable Ramsey and definable Erdös ordinals, The realist theory of meaning, Partially Conservative Extensions of Arithmetic, On Σ‐definability without equality over the real numbers, Polish group actions, nice topologies, and admissible sets, Unnamed Item, Definability in the Infix Order on Words, Composition aspects of programmology. I, Universal co-analytic sets, Beweistheorie vonKPN, Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees, The role of the Omitting Types Theorem in infinitary logic, Extensions of countable infinitary logic which preserve most of its nice properties, Cut-elimination for impredicative infinitary systems part I. Ordinal-analysis for ID1, Zur Beweistheorie Der Kripke-Platek-Mengenlehre Über Den Natürlichen Zahlen, Recursively Saturated Models of Set Theory, Some model theory for monotone quantifiers, Compact and ϖ-compact formulas in 51-151-151-1, A Generalized Kleene-Moschovakis Theorem, On automorphism groups of countable structures, A Rather Classless Model, The Monotone Class Theorem in Infinitary Logic
