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