A Note on Bootstrapping Intuitionistic Bounded Arithmetic
نویسنده
چکیده
This paper, firstly, discusses the relationship between Buss’s definition and Cook and Urquhart’s definition of BASIC axioms and of IS 2 . The two definitions of BASIC axioms are not equivalent; however, each intuitionistically implies the law of the excluded middle for quantifier-free formulas. There is an elementary proof that the definitions of IS 2 are equivalent which is not based on realizability or functional interpretations. Secondly, it is shown that any negated positive consequence of S 2 is also a theorem of IS 2 . Some possible additional axioms for IS 1 2 are investigated.
منابع مشابه
Interval-valued intuitionistic fuzzy aggregation methodology for decision making with a prioritization of criteria
Interval-valued intuitionistic fuzzy sets (IVIFSs), a generalization of fuzzy sets, is characterized by an interval-valued membership function, an interval-valued non-membership function.The objective of this paper is to deal with criteria aggregation problems using IVIFSs where there exists a prioritization relationship over the criteria.Based on the ${L}$ukasiewicz triangular norm, we first p...
متن کاملArithmetic Aggregation Operators for Interval-valued Intuitionistic Linguistic Variables and Application to Multi-attribute Group Decision Making
The intuitionistic linguistic set (ILS) is an extension of linguisitc variable. To overcome the drawback of using single real number to represent membership degree and non-membership degree for ILS, the concept of interval-valued intuitionistic linguistic set (IVILS) is introduced through representing the membership degree and non-membership degree with intervals for ILS in this paper. The oper...
متن کاملApplications of positive and intuitionistic bounded arithmetic to proof complexity
We introduce uniform versions of monotone and deep inference proof systems in the setting of bounded arithmetic, relating the size of propositional proofs to forms of proof-theoretic strength in weak fragments of arithmetic. This continues the recent program of studying the complexity of propositional deep inference. In particular this work is inspired by previous work where proofs of the propo...
متن کاملPreservation theorems for bounded formulas
In this paper we naturally define when a theory has bounded quantifier elimination, or is bounded model complete. We give several equivalent conditions for a theory to have each of these properties. These results provide simple proofs for some known results in the model theory of the bounded arithmetic theories like CPV and PV1. We use the mentioned results to obtain some independence results i...
متن کاملComparing Constructive Arithmetical Theories Based on NP-PIND and coNP-PIND
In this note we show that the intuitionistic theory of polynomial induction on Π 1 -formulas does not imply the intuitionistic theory IS 1 2 of polynomial induction on Σ 1 -formulas. We also show the converse assuming the Polynomial Hierarchy does not collapse. Similar results hold also for length induction in place of polynomial induction. We also investigate the relation between various other...
متن کامل