Pages that link to "Item:Q5654035"
From MaRDI portal
The following pages link to Existence and feasibility in arithmetic (Q5654035):
Displaying 50 items.
- J-Calc: a typed lambda calculus for intuitionistic justification logic (Q276037) (← links)
- The logic of justified belief, explicit knowledge, and conclusive evidence (Q392273) (← links)
- On the concept of finitism (Q510710) (← links)
- Homomorphisms and chains of Kripke models (Q535159) (← links)
- Diophantine induction (Q584258) (← links)
- Preservation theorems and restricted consistency statements in bounded arithmetic (Q598285) (← links)
- Quadratic forms in models of \(I\Delta_0 + \Omega_1\). II: Local equivalence (Q639651) (← links)
- P, NP, Co-NP and weak systems of arithmetic (Q672742) (← links)
- The unprovability of small inconsistency. A study of local and global interpretability (Q688510) (← links)
- Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA (Q711565) (← links)
- The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem (Q843609) (← links)
- Bounded functional interpretation and feasible analysis (Q866559) (← links)
- Feasible operations on proofs: the logic of proofs for bounded arithmetic (Q929293) (← links)
- \(S_{k,\text{exp}}\) does not prove \(\text{NP} = \text{co-NP}\) uniformly (Q937909) (← links)
- Provably recursive functions of constructive and relatively constructive theories (Q964451) (← links)
- On the scheme of induction for bounded arithmetic formulas (Q1104318) (← links)
- On the number of steps in proofs (Q1119576) (← links)
- The formalization of interpretability (Q1176098) (← links)
- Arithmetizing uniform \(NC\) (Q1176198) (← links)
- Combinatorial principles in elementary number theory (Q1182430) (← links)
- Intuitionistic elementary arithmetic (Q1204675) (← links)
- Turning cycles into spirals (Q1295442) (← links)
- Bounded arithmetic, proof complexity and two papers of Parikh (Q1295443) (← links)
- Formal frameworks for approximate reasoning (Q1311748) (← links)
- Hereditarily-finite sets, data bases and polynomial-time computability (Q1311973) (← links)
- Elementary realizability (Q1362589) (← links)
- On parallel hierarchies and \(R_k^i\) (Q1377627) (← links)
- \(\Delta\)-languages for sets and LOGSPACE computable graph transformers (Q1392148) (← links)
- Skolem functions of arithmetical sentences. (Q1427862) (← links)
- Non-standard finite fields over \(I\Delta_0+\Omega_1\) (Q1567349) (← links)
- Multifunction algebras and the provability of \(PH\downarrow\) (Q1577486) (← links)
- Provability logic and the completeness principle (Q1740459) (← links)
- Dual weak pigeonhole principle, Boolean complexity, and derandomization (Q1887654) (← links)
- Relating the bounded arithmetic and polynomial time hierarchies (Q1899144) (← links)
- Pell equations and exponentiation in fragments of arithmetic (Q1919524) (← links)
- Feasibly constructive proofs of succinct weak circuit lower bounds (Q2007873) (← links)
- Some paradoxes of infinity revisited (Q2148333) (← links)
- Inconsistency in mathematics and the mathematics of inconsistency (Q2263045) (← links)
- Radical anti-realism, Wittgenstein and the length of proofs (Q2268776) (← links)
- Triangular norm based predicate fuzzy logics (Q2270233) (← links)
- Quadratic forms in models of \(I\Delta _{0}+\Omega _{1}\). I (Q2382276) (← links)
- Interpretability suprema in Peano arithmetic (Q2402961) (← links)
- A theory of hyperfinite sets (Q2433742) (← links)
- Bounded functional interpretation (Q2488269) (← links)
- Upper and lower Ramsey bounds in bounded arithmetic (Q2488271) (← links)
- Logics for reasoning about cryptographic constructions (Q2490263) (← links)
- A generalization of the second incompleteness theorem and some exceptions to it (Q2500470) (← links)
- The absorption law. Or: how to Kreisel a Hilbert-Bernays-Löb (Q2663342) (← links)
- Build your own clarithmetic I: Setup and completeness (Q2974779) (← links)
- A Conservation Result Concerning Bounded Theories and the Collection Axiom (Q3029007) (← links)
