scientific article; zbMATH DE number 3494394
From MaRDI portal
Publication:4075450
Cited in
(only showing first 100 items - show all)- 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
- -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
- On the complexity of formulas in semantic programming
- Nonpresentability of some structures of analysis in hereditarily finite superstructures
- Scott ranks of models of a theory
- A representation of recursively enumerable sets through Horn formulas in higher recursion theory
- Tarski-type problems for free associative algebras
- What does a group algebra of a free group ``know about the group?
- The scope of Feferman's semi-intuitionistic set theories and his second conjecture
- The subcompleteness of Magidor forcing
- Bounds on the strength of ordinal definable determinacy in small admissible sets
- An ordinal analysis of stability
- An ordinal analysis of parameter free \(\Pi^{1}_{2}\)-comprehension
- Models of set theory with definable ordinals
- Fuzzy sets within finitely supported mathematics
- 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
- A Buchholz rule for modal fixed point logics
- Linear ordering on graphs, anti-founded sets and polynomial time computability
- Admissibles in gaps
- Infinite time busy beavers
- Absolute and relative properties of negatively numbered families
- Pure \(\Sigma_2\)-elementarity beyond the core
- Long Borel games
- An indeterminate universe of sets
- Maximality and ontology: how axiom content varies across philosophical frameworks
- Patterns of resemblance and Bachmann-Howard fixed points
- Predicativity and constructive mathematics
- Clockability for ordinal Turing machines
- Stage comparison, fixed points, and least fixed points in Kripke-Platek environments
- Copies from ``Standard set theory? A note on the foundations of minimalist syntax in reaction to Chomsky, Gallego and Ott (2019)
- Condensable models of set theory
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4075450)
