The following pages link to (Q4075450):
Displaying 50 items.
- Non-well-founded sets via revision rules (Q1337508) (← links)
- The strength of some Martin-Löf type theories (Q1344548) (← links)
- Issues in commonsense set theory (Q1346620) (← links)
- Toward a generalized computability theory (Q1346903) (← links)
- On the proof-theoretic strength of monotone induction in explicit mathematics (Q1356976) (← links)
- HYPERSOLVER: A graphical tool for commonsense set theory (Q1357081) (← links)
- An algebraic theory of structured objects (Q1377554) (← links)
- \(\Delta\)-languages for sets and LOGSPACE computable graph transformers (Q1392148) (← links)
- Semantics for finite delay (Q1392281) (← links)
- Proof theory for theories of ordinals. I: Recursively Mahlo ordinals (Q1400597) (← links)
- Functional interpretation of Aczel's constructive set theory (Q1577478) (← links)
- Generalized logical consequence: Making room for induction in the logic of science (Q1610619) (← links)
- On the complexity of formulas in semantic programming (Q1615728) (← links)
- Nonpresentability of some structures of analysis in hereditarily finite superstructures (Q1644856) (← links)
- Scott ranks of models of a theory (Q1644961) (← links)
- A representation of recursively enumerable sets through Horn formulas in higher recursion theory (Q1677584) (← links)
- Tarski-type problems for free associative algebras (Q1702719) (← links)
- What does a group algebra of a free group ``know'' about the group? (Q1709682) (← links)
- The scope of Feferman's semi-intuitionistic set theories and his second conjecture (Q1740613) (← links)
- The subcompleteness of Magidor forcing (Q1745351) (← links)
- Bounds on the strength of ordinal definable determinacy in small admissible sets (Q1762358) (← links)
- An ordinal analysis of stability (Q1765099) (← links)
- An ordinal analysis of parameter free \(\Pi^{1}_{2}\)-comprehension (Q1777268) (← links)
- Models of set theory with definable ordinals (Q1777270) (← links)
- Fuzzy sets within finitely supported mathematics (Q1794962) (← links)
- Possible-worlds semantics for modal notions conceived as predicates (Q1810820) (← links)
- \(\Sigma\)-predicates of finite types over an admissible set (Q1820777) (← links)
- Ptykes in Gödels T und Definierbarkeit von Ordinalzahlen. (Ptykes in Gödel's T and definability of ordinal numbers) (Q1825868) (← links)
- On natural number objects, finiteness and Kripke-Platek models in toposes (Q1825947) (← links)
- Skolem redux (Q1860974) (← links)
- Universes over Frege structures (Q1861539) (← links)
- A contextual-hierarchical approach to truth and the liar paradox (Q1876081) (← links)
- The real core model and its scales (Q1892098) (← links)
- Levels of truth (Q1903585) (← links)
- Investigations on slow versus fast growing: How to majorize slow growing functions nontrivially by fast growing ones (Q1908812) (← links)
- Categoricity of finitely generated algebraic systems in HF-logic (Q1910286) (← links)
- Normal forms for second-order logic over finite structures, and classification of NP optimization problems (Q1919763) (← links)
- Complexity and undecidability results for logic programming (Q1924779) (← links)
- A Buchholz rule for modal fixed point logics (Q1942334) (← links)
- Linear ordering on graphs, anti-founded sets and polynomial time computability (Q1960423) (← links)
- Admissibles in gaps (Q2011650) (← links)
- Infinite time busy beavers (Q2011657) (← links)
- Absolute and relative properties of negatively numbered families (Q2030136) (← links)
- Pure \(\Sigma_2\)-elementarity beyond the core (Q2041963) (← links)
- Long Borel games (Q2048863) (← links)
- An indeterminate universe of sets (Q2054115) (← links)
- Maximality and ontology: how axiom content varies across philosophical frameworks (Q2054121) (← links)
- Patterns of resemblance and Bachmann-Howard fixed points (Q2064043) (← links)
- Predicativity and constructive mathematics (Q2080590) (← links)
- Clockability for ordinal Turing machines (Q2106588) (← links)
