The following pages link to (Q5286672):
Displaying 50 items.
- A note on typed truth and consistency assertions (Q263089) (← links)
- On predicate provability logics and binumerations of fragments of Peano arithmetic (Q377475) (← links)
- Positive provability logic for uniform reflection principles (Q392274) (← links)
- Weak theories of concatenation and arithmetic (Q435240) (← links)
- Categorical characterizations of the natural numbers require primitive recursion (Q476119) (← links)
- Construction of models of bounded arithmetic by restricted reduced powers (Q506954) (← links)
- On the possibilistic approach to linear regression models involving uncertain, indeterminate or interval data (Q508691) (← links)
- Deflationary truth and the ontology of expressions (Q513895) (← links)
- Notes on the computational aspects of Kripke's theory of truth (Q526739) (← links)
- Proof lengths for instances of the Paris-Harrington principle (Q526964) (← links)
- Theories of initial segments of standard models of arithmetics and their complete extensions (Q549718) (← links)
- Implicit definability of subfields (Q558423) (← links)
- Graph properties checkable in linear time in the number of vertices (Q596315) (← links)
- The incompleteness theorems after 70 years (Q598275) (← links)
- The strength of sharply bounded induction requires MSP (Q636290) (← links)
- Bootstrapping. I (Q636291) (← links)
- The strength of extensionality. II: Weak weak set theories without infinity (Q639665) (← links)
- Introduction to clarithmetic. I (Q642523) (← links)
- The self-embedding theorem of \(\text{WKL}_ 0\) and a non-standard method (Q676310) (← links)
- Epistemic entrenchment and arithmetical hierarchy (Q685538) (← links)
- Faith \& falsity (Q705533) (← links)
- Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA (Q711565) (← links)
- Algorithmic randomness, reverse mathematics, and the dominated convergence theorem (Q714719) (← links)
- Independence results for variants of sharply bounded induction (Q716498) (← links)
- Short propositional refutations for dense random 3CNF formulas (Q741088) (← links)
- The equivalence of theories that characterize ALogTime (Q834715) (← links)
- Modeling sorites reasoning with adaptive fuzzy logic (Q835187) (← links)
- Partial collapses of the \(\Sigma _1\) complexity hierarchy in models for fragments of bounded arithmetic (Q866557) (← links)
- Preservation theorems for bounded formulas (Q866887) (← links)
- Transductions in arithmetic (Q904144) (← links)
- Tarski on ``essentially richer'' metalanguages (Q1283316) (← links)
- Bounded arithmetic, proof complexity and two papers of Parikh (Q1295443) (← links)
- Induction rules, reflection principles, and provably recursive functions (Q1361250) (← links)
- End extensions of models of linearly bounded arithmetic (Q1377910) (← links)
- Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms (Q1401230) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- Skolem functions of arithmetical sentences. (Q1427862) (← links)
- On the computational complexity of reachability in 2D binary images and some basic problems of 2D digital topology (Q1603641) (← links)
- The proof-theoretic strength of Ramsey's theorem for pairs and two colors (Q1644984) (← links)
- The omega-rule interpretation of transfinite provability logic (Q1694812) (← links)
- On \(\mathsf{Q}\) (Q1699730) (← links)
- The logical strength of compositional principles (Q1704080) (← links)
- On the jumps of the degrees below a recursively enumerable degree (Q1704085) (← links)
- Fixed points of self-embeddings of models of arithmetic (Q1709680) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017 (Q1731963) (← links)
- Dickson's lemma and weak Ramsey theory (Q1734268) (← links)
- On partial disjunction properties of theories containing Peano arithmetic (Q1756504) (← links)
- On Brouwer's continuity principle (Q1788331) (← links)
- Intrinsic reasoning about functional programs. II: Unipolar induction and primitive-recursion (Q1827398) (← links)
- Some conservation results on weak König's lemma (Q1849864) (← links)
