scientific article
From MaRDI portal
Publication:4075450
zbMath0316.02047MaRDI QIDQ4075450
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Model theory (03C99) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Large cardinals (03E55) Other infinitary logic (03C75) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items
WHICH CLASSES OF STRUCTURES ARE BOTH PSEUDO-ELEMENTARY AND DEFINABLE BY AN INFINITARY SENTENCE? ⋮ LOGICALITY AND MODEL CLASSES ⋮ On revision operators ⋮ Zur Beweistheorie Der Kripke-Platek-Mengenlehre Über Den Natürlichen Zahlen ⋮ Definable Subsets of Polynomial-Time Algebraic Structures ⋮ Biprobability logic with conditional expectation ⋮ CONSERVATIVITY FOR THEORIES OF COMPOSITIONAL TRUTH VIA CUT ELIMINATION ⋮ Simplified Cut Elimination for Kripke-Platek Set Theory ⋮ Well-Ordering Principles in Proof Theory and Reverse Mathematics ⋮ The Countable Henkin Principle ⋮ Changing a Semantics: Opportunism or Courage? ⋮ Potential isomorphisms of generalized approach spaces ⋮ $$ITRM$$-Recognizability from Random Oracles ⋮ A Π¹₁-uniformization principle for reals ⋮ VARIATIONS ON DETERMINACY AND ℵω1 ⋮ On Processes and Structures ⋮ Reflection of Long Game Formulas ⋮ Recursively Saturated Models of Set Theory ⋮ ABOUT SOME FIXED POINT AXIOMS AND RELATED PRINCIPLES IN KRIPKE–PLATEK ENVIRONMENTS ⋮ RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY ⋮ From compositional to systematic semantics ⋮ Existential Fixed-Point Logic as a Fragment of Second-Order Logic ⋮ RELATIVIZING OPERATIONAL SET THEORY ⋮ Set theory with a proper class of indiscernibles ⋮ On the relative strengths of fragments of collection ⋮ Enumeration Reducibility and Computable Structure Theory ⋮ Computable Model Theory over the Reals ⋮ Wellfoundedness proof with the maximal distinguished set ⋮ Composition aspects of programmology. I ⋮ On Σ‐definability without equality over the real numbers ⋮ Polish group actions, nice topologies, and admissible sets ⋮ Computing on structures ⋮ Theses for Computation and Recursion on Concrete and Abstract Structures ⋮ ZFC PROVES THAT THE CLASS OF ORDINALS IS NOT WEAKLY COMPACT FOR DEFINABLE CLASSES ⋮ Multiverse Conceptions in Set Theory ⋮ Evidence for Set-Theoretic Truth and the Hyperuniverse Programme ⋮ Definability of Satisfaction in Outer Models ⋮ Ordinal Analysis of Intuitionistic Power and Exponentiation Kripke Platek Set Theory ⋮ From Subsystems of Analysis to Subsystems of Set Theory ⋮ From Mathesis Universalis to Fixed Points and Related Set-Theoretic Concepts ⋮ On Relating Theories: Proof-Theoretical Reduction ⋮ Inner models from extended logics: Part 1 ⋮ Definable Ramsey and definable Erdös ordinals ⋮ Polish group actions: Dichotomies and generalized elementary embeddings ⋮ Polish Group Actions and the Vaught Conjecture ⋮ Canonical fragments of the strong reflection principle ⋮ Fixed Points on the Real Numbers without the Equality Test ⋮ Remarks on Σ–definability without the equality test over the Reals ⋮ A Gandy Theorem for Abstract Structures and Applications to First-Order Definability ⋮ Universal co-analytic sets ⋮ Unnamed Item ⋮ LOGIC IN THE TRACTATUS ⋮ INSTANTIAL NEIGHBOURHOOD LOGIC ⋮ ULTIMATE TRUTHVIS-À-VISSTABLE TRUTH ⋮ Explicit descriptions of injective envelopes: generalizations of a result of northcott ⋮ Elementary patterns of resemblance ⋮ Some model theory for monotone quantifiers ⋮ Forcing closed unbounded subsets of \(\omega_2\) ⋮ The strength of Mac Lane set theory ⋮ The realist theory of meaning ⋮ Uniquely undefinable elements ⋮ Index sets for classes of high rank structures ⋮ TRUTHS, INDUCTIVE DEFINITIONS, AND KRIPKE-PLATEK SYSTEMS OVER SET THEORY ⋮ Beweistheorie vonKPN ⋮ Recursive Labelling Systems and Stability of Recursive Structures in Hyperarithmetical Degrees ⋮ Partially Conservative Extensions of Arithmetic ⋮ CLASSES OF STRUCTURES WITH NO INTERMEDIATE ISOMORPHISM PROBLEMS ⋮ Putnam’s Constructivization Argument ⋮ On Some Semi-constructive Theories Related to Kripke–Platek Set Theory ⋮ Proof Theory of Constructive Systems: Inductive Types and Univalence ⋮ Compact and ϖ-compact formulas in 51-151-151-1 ⋮ The Search for New Axioms in the Hyperuniverse Programme ⋮ The Search for New Axioms in the Hyperuniverse Programme ⋮ MINIMUM MODELS OF SECOND-ORDER SET THEORIES ⋮ INEFFABILITY AND REVENGE ⋮ Definability in the Infix Order on Words ⋮ CALIBRATING DETERMINACY STRENGTH IN LEVELS OF THE BOREL HIERARCHY ⋮ On a positive set theory with inequality ⋮ A Computable Structure with Non-Standard Computability ⋮ The role of the Omitting Types Theorem in infinitary logic ⋮ Bounds on Scott ranks of some polish metric spaces ⋮ 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 ⋮ UNIVERSISM AND EXTENSIONS OF V ⋮ Constructive Zermelo-Fraenkel Set Theory, Power Set, and the Calculus of Constructions ⋮ A Generalized Kleene-Moschovakis Theorem ⋮ On automorphism groups of countable structures ⋮ Having a Look Again at Some Theories ofProof-Theoretic Strengths around $$ \varGamma_{0} $$ ⋮ The Limits of Predicativity Revisited ⋮ Well-ordering Principles, ω-models and $$ \varPi_{1}^{1} $$-comprehension ⋮ An Upper Bound for the Proof-Theoretic Strength of Martin-Löf Type Theory with W-type and One Universe ⋮ A Glimpse of $$ \sum_{3} $$-elementarity ⋮ Cut-elimination for impredicative infinitary systems part I. Ordinal-analysis for ID1 ⋮ A NEGLECTED RESOLUTION OF RUSSELL’S PARADOX OF PROPOSITIONS ⋮ THE ORDER OF REFLECTION ⋮ INITIAL SELF-EMBEDDINGS OF MODELS OF SET THEORY ⋮ GAMES AND INDUCTION ON REALS ⋮ A Rather Classless Model ⋮ The completeness of the isomorphism relation for countable Boolean algebras ⋮ The Monotone Class Theorem in Infinitary Logic ⋮ On the complexity of formulas in semantic programming ⋮ A contextual-hierarchical approach to truth and the liar paradox ⋮ A sufficient condition for nonpresentability of structures in hereditarily finite superstructures ⋮ Non-well-founded sets via revision rules ⋮ Copies from ``Standard set theory? A note on the foundations of minimalist syntax in reaction to Chomsky, Gallego and Ott (2019) ⋮ The strength of some Martin-Löf type theories ⋮ The real core model and its scales ⋮ Determinacy and monotone inductive definitions ⋮ Issues in commonsense set theory ⋮ Toward a generalized computability theory ⋮ Condensable models of set theory ⋮ Nonpresentability of some structures of analysis in hereditarily finite superstructures ⋮ Scott ranks of models of a theory ⋮ Recursive programs and denotational semantics in absolute logics of programs ⋮ Bounds on Scott rank for various nonelementary classes ⋮ On the proof-theoretic strength of monotone induction in explicit mathematics ⋮ HYPERSOLVER: A graphical tool for commonsense set theory ⋮ A non-hyperarithmetical Gödel logic ⋮ Varieties of complex algebras ⋮ Decision times of infinite computations ⋮ Levels of truth ⋮ On the isomorphism problem for some classes of computable algebraic structures ⋮ Set theoretical analogues of the Barwise-Schlipf theorem ⋮ 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 ⋮ Inner constructivizability of functional structures ⋮ Strict \({\varPi^1_1}\)-reflection in bounded arithmetic ⋮ The countable admissible ordinal equivalence relation ⋮ Generalized hyperarithmetical computability over structures ⋮ Processes and structures on approximation spaces ⋮ Determinacy in third order arithmetic ⋮ An algebraic theory of structured objects ⋮ Normal forms for second-order logic over finite structures, and classification of NP optimization problems ⋮ Complexity and undecidability results for logic programming ⋮ A representation of recursively enumerable sets through Horn formulas in higher recursion theory ⋮ End extending models of set theory via power admissible covers ⋮ \(\Delta\)-languages for sets and LOGSPACE computable graph transformers ⋮ Semantics for finite delay ⋮ On mutual definability of operations on fields ⋮ Positive numberings in admissible sets ⋮ The Keisler order in continuous logic ⋮ Proof theory for theories of ordinals. I: Recursively Mahlo ordinals ⋮ A Buchholz rule for modal fixed point logics ⋮ Tarski-type problems for free associative algebras ⋮ What does a group algebra of a free group ``know about the group? ⋮ A few more dissimilarities between second-order arithmetic and set theory ⋮ Computable positive and Friedberg numberings in hyperarithmetic ⋮ Linear ordering on graphs, anti-founded sets and polynomial time computability ⋮ Hierarchy of families of theories and their rank characteristics ⋮ A propositional linear time logic with time flow isomorphic to \(\omega^2\) ⋮ Encoding complete metric structures by classical structures ⋮ Logics of intuitionistic Kripke-Platek set theory ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting) ⋮ The scope of Feferman's semi-intuitionistic set theories and his second conjecture ⋮ The subcompleteness of Magidor forcing ⋮ Thin equivalence relations and inner models ⋮ On transferring model theoretic theorems of \(\mathcal L_{\infty,\omega}\) in the category of sets to a fixed Grothendieck topos ⋮ Bounding lemmata for non-deterministic halting times of transfinite Turing machines ⋮ Bounds on the strength of ordinal definable determinacy in small admissible sets ⋮ An ordinal analysis of stability ⋮ On the relationship between fixed points and iteration in admissible set theory without foundation ⋮ Admissibles in gaps ⋮ Infinite time busy beavers ⋮ Levy and set theory ⋮ An ordinal analysis of parameter free \(\Pi^{1}_{2}\)-comprehension ⋮ Models of set theory with definable ordinals ⋮ \(\Pi_1^1\)-comprehension as a well-ordering principle ⋮ Expressivity of second order propositional modal logic ⋮ Characterizing the interpretation of set theory in Martin-Löf type theory ⋮ Proof theory and ordinal analysis ⋮ A modal proof theory for final polynomial coalgebras ⋮ Absolute and relative properties of negatively numbered families ⋮ Fuzzy sets within finitely supported mathematics ⋮ Properties of the atoms in finitely supported structures ⋮ Notes on some second-order systems of iterated inductive definitions and \(\Pi_1^1\)-comprehensions and relevant subsystems of set theory ⋮ Completeness theorems for \(\sigma \)-additive probabilistic semantics ⋮ Pure \(\Sigma_2\)-elementarity beyond the core ⋮ Long Borel games ⋮ \(\Sigma\)-preorderings in \(\mathbb{HF}(\mathbb{R} )\) ⋮ Possible-worlds semantics for modal notions conceived as predicates ⋮ An indeterminate universe of sets ⋮ Maximality and ontology: how axiom content varies across philosophical frameworks ⋮ Determinacy separations for class games ⋮ Patterns of resemblance and Bachmann-Howard fixed points ⋮ \(\Sigma\)-predicates of finite types over an admissible set ⋮ Logical language of description of polynomial computing ⋮ 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 ⋮ Functional interpretation of Aczel's constructive set theory ⋮ Predicativity and constructive mathematics ⋮ On decidability of list structures ⋮ Partial decidable presentations in hyperarithmetic ⋮ \(\Sigma\)-presentations of the ordering on the reals ⋮ Properties of \(s\Sigma\)-reducibility ⋮ A new model construction by making a detour via intuitionistic theories. II: Interpretability lower bound of Feferman's explicit mathematics \(T_0\) ⋮ Clockability for ordinal Turing machines ⋮ Skolem redux ⋮ Universes over Frege structures ⋮ Stage comparison, fixed points, and least fixed points in Kripke-Platek environments ⋮ Generalized logical consequence: Making room for induction in the logic of science ⋮ Well ordering principles for iterated \(\Pi^1_1\)-comprehension ⋮ Locally hyperarithmetical induction ⋮ Foundations of applied mathematics. I ⋮ The Π21$\Pi ^1_2$ consequences of a theory ⋮ POINCARÉ–WEYL’S PREDICATIVITY: GOING BEYOND ⋮ The modal mu-calculus alternation hierarchy is strict ⋮ Logical problems of functional interpretations ⋮ Borel equivalence relations and classifications of countable models ⋮ Improving a bounding result that constructs models of high Scott rank ⋮ Generalizing Kruskal's theorem to pairs of cohabitating trees ⋮ Induction and foundation in the theory of hereditarily finite sets ⋮ A constructive consistency proof of a fragment of set theory ⋮ Stratified least fixpoint logic ⋮ Proof theory of reflection ⋮ Predicativity, the Russell-Myhill paradox, and Church's intensional logic ⋮ 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 ⋮ Fragments of Kripke-Platek set theory and the metamathematics of \(\alpha \)-recursion theory ⋮ Playing with admissibility spectra ⋮ Admissibility spectra and minimality ⋮ Applications of Fodor's lemma to Vaught's conjecture ⋮ Generatability of admissible sets ⋮ Completeness theorem for topological class models ⋮ The Galvin-Prikry theorem and set existence axioms ⋮ Existence of an inseparable pair in the recursive theory of admissible sets ⋮ Computational inductive definability ⋮ Descriptive characterizations of computational complexity ⋮ Bilattices and the theory of truth ⋮ On computable automorphisms in formal concept analysis ⋮ Definability in the structure of words with the inclusion relation ⋮ Deductive reasoning in the structuralist approach ⋮ Operational closure and stability ⋮ A proof-theoretic account of classical principles of truth ⋮ Relativized ordinal analysis: the case of power Kripke-Platek set theory ⋮ Descriptive properties on admissible sets ⋮ Sacks forcing does not always produce a minimal upper bound ⋮ On \(\Sigma\)-rigid presentations of the real order ⋮ Vaught's conjecture without equality ⋮ Vapnik-Chervonenkis density on indiscernible sequences, stability, and the maximum property ⋮ Invariant measures via inverse limits of finite structures ⋮ The effective theory of Borel equivalence relations ⋮ A logic of abstraction related to finite constructive number classes ⋮ \(\lambda\)-structures and \(s\)-structures: translating the models ⋮ The strength of extensionality. II: Weak weak set theories without infinity ⋮ From the weak to the strong existence property ⋮ Classes and truths in set theory ⋮ Polish group actions and effectivity ⋮ On the conservativity of the axiom of choice over set theory ⋮ Partial isomorphisms and intuitionistic logic ⋮ Nonpresentability of the semigroup \(\omega^\omega\) over \(\mathbb H\mathbb F(\mathbb R)\) ⋮ A new model construction by making a detour via intuitionistic theories. I: Operational set theory without choice is \(\Pi_1\)-equivalent to KP ⋮ The complexity of antidifferentiation ⋮ On the admissible sets of type \(\mathbb{H}\mathbb{Y}\mathbb{P}(\mathfrak M)\) over recursively saturated models ⋮ 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\) ⋮ Canonical completeness of infinitary \(\mu \) ⋮ Intuitionistic fixed point theories over set theories ⋮ Computing with infinitary logic ⋮ Algebraization of quantifier logics, an introductory overview ⋮ Effective oracles ⋮ Forcing in admissible sets ⋮ Multiverse conceptions in set theory ⋮ A slight strengthening of a theorem of Blair and Kunen ⋮ Countable structures \(\Sigma \)-definable over classical continuous number systems ⋮ Query languages for hierarchic databases ⋮ Ehrenfeucht-Fraïssé games in finite set theory ⋮ A semilattice of numberings. II ⋮ Fixed points for the jump operator ⋮ Some presentations of the real number field ⋮ On the axiom of union ⋮ Existence of saturated structures ⋮ Some applications of Henkin quantifiers ⋮ Decidability and definability with circumscription ⋮ Refusal testing ⋮ Partial automorphism semigroups ⋮ Operational set theory and small large cardinals ⋮ 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 ⋮ New axiomatizations for logics with generalized quantifiers ⋮ Patterns of resemblance of order 2 ⋮ Each family of subsets of the urelements generates an admissible set ⋮ Modal languages and bounded fragments of predicate logic ⋮ The many faces of interpolation ⋮ The Craig interpolation theorem in abstract model theory ⋮ Isomorphic incidence algebras ⋮ The modal mu-calculus alternation hierarchy is strict ⋮ Countably decomposable admissible sets ⋮ Model theory for \(L_{\infty \omega _ 1}\) ⋮ Strong \(\Delta_1\)-definability of a model in an admissible set ⋮ Rank-initial embeddings of non-standard models of set theory ⋮ Borel equivalence relations induced by actions of the symmetric group ⋮ Well-ordering proofs for Martin-Löf type theory ⋮ In conjunction with qualitative probability ⋮ Iterating ordinal definability ⋮ Uncountable admissibles. II: Compactness ⋮ Probability logic with conditional expectation ⋮ On conceptual completeness of syntactic-semantical systems ⋮ Hierarchies of program logics ⋮ Hereditarily-finite sets, data bases and polynomial-time computability ⋮ Proof-theoretic analysis of KPM ⋮ Admissible sets in group theory ⋮ Generalizing classical and effective model theory in theories of operations and classes ⋮ Principal numerations of functionals on admissible sets ⋮ Collapsing functions based on recursively large ordinals: A well-ordering proof for KPM ⋮ Comparing inductive and circular definitions: Parameters, complexity and games
