Existence and feasibility in arithmetic
From MaRDI portal
Publication:5654035
Cites work
Cited in
(80)- The absorption law. Or: how to Kreisel a Hilbert-Bernays-Löb
- Purity and Explanation: Essentially Linked?
- Notes on my scientific life
- Some structural similarities between uncountable sets, powersets and the universe
- Implicit computation complexity in higher-order programming languages
- Grzegorcyk's hierarchy and IepΣ1
- scientific article; zbMATH DE number 3483945 (Why is no real title available?)
- On parallel hierarchies and R ki
- Parikh and Wittgenstein
- Upper and lower Ramsey bounds in bounded arithmetic
- Complexity barriers as independence
- On feasible numbers
- On V.A. Yankov’s Contribution to the History of Foundations of Mathematics
- Inconsistency in mathematics and the mathematics of inconsistency
- ON SHAVRUKOV’S NON-ISOMORPHISM THEOREM FOR DIAGONALIZABLE ALGEBRAS
- Two General Results on Intuitionistic Bounded Theories
- Primitive recursive reverse mathematics
- Feasible operations on proofs: the logic of proofs for bounded arithmetic
- Strict finitism, feasibility, and the sorites
- The formalization of interpretability
- Triangular norm based predicate fuzzy logics
- Combinatorics with Definable Sets: Euler Characteristics and Grothendieck Rings
- J-Calc: a typed lambda calculus for intuitionistic justification logic
- Intuitionistic elementary arithmetic
- Abelian groups and quadratic residues in weak arithmetic
- The logic of justified belief, explicit knowledge, and conclusive evidence
- Elementary realizability
- Logics for reasoning about cryptographic constructions
- The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem
- On parallel hierarchies and \(R_k^i\)
- Bounded functional interpretation and feasible analysis
- A theory of hyperfinite sets
- Quadratic forms in models of \(I\Delta _{0}+\Omega _{1}\). I
- Arithmetizing uniform \(NC\)
- A generalization of the second incompleteness theorem and some exceptions to it
- Dual weak pigeonhole principle, Boolean complexity, and derandomization
- P, NP, Co-NP and weak systems of arithmetic
- On the finite axiomatizability of \(\forall\hat{\Sigma}^{\mathrm{b}}_1 (\hat{\mathsf{R}}^1_2)\)
- Multifunction algebras and the provability of \(PH\downarrow\)
- Pell equations and exponentiation in fragments of arithmetic
- Hereditarily-finite sets, data bases and polynomial-time computability
- Skolem functions of arithmetical sentences.
- Bounded arithmetic, proof complexity and two papers of Parikh
- Strict finitism and feasibility
- The unprovability of small inconsistency. A study of local and global interpretability
- Relating the bounded arithmetic and polynomial time hierarchies
- Asymptotic cyclic expansion and bridge groups of formal proofs
- A Universal Approach to Self-Referential Paradoxes, Incompleteness and Fixed Points
- Turning cycles into spirals
- The sorites paradox and fuzzy logic
- Build your own clarithmetic. I: Setup and completeness
- On the scheme of induction for bounded arithmetic formulas
- Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA
- Formal frameworks for approximate reasoning
- scientific article; zbMATH DE number 7155168 (Why is no real title available?)
- Diophantine induction
- Radical anti-realism, Wittgenstein and the length of proofs
- Provability logic and the completeness principle
- Combinatorial principles in elementary number theory
- The Complexity of Propositional Proofs
- Some Results on the Length of Proofs
- \(S_{k,\text{exp}}\) does not prove \(\text{NP} = \text{co-NP}\) uniformly
- Polynomial local search in the polynomial hierarchy and witnessing in fragments of bounded arithmetic
- Non-standard finite fields over \(I\Delta_0+\Omega_1\)
- On the number of steps in proofs
- Homomorphisms and chains of Kripke models
- Feasibly constructive proofs of succinct weak circuit lower bounds
- Cycling in proofs and feasibility
- A Conservation Result Concerning Bounded Theories and the Collection Axiom
- Provably recursive functions of constructive and relatively constructive theories
- On the concept of finitism
- Some paradoxes of infinity revisited
- \(\Delta\)-languages for sets and LOGSPACE computable graph transformers
- Proof theoretic analysis by iterated reflection
- Quadratic forms in models of \(I\Delta_0 + \Omega_1\). II: Local equivalence
- Preservation theorems and restricted consistency statements in bounded arithmetic
- Approximate counting and NP search problems
- Interpretability suprema in Peano arithmetic
- FUZZY LOGIC, FUZZY SETS, AND NATURAL LANGUAGES
- Bounded functional interpretation
This page was built for publication: Existence and feasibility in arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5654035)
