Add to ORKGThe theories Si1(®) and T i 1(®) are the analogues of Buss ' relativized bounded arithmetic theories in the language where every term is bounded by a poly-nomial, and thus all de¯nable functions grow linearly in length. For every i, a §bi+1(®)-formula TOP i(a), which expresses a form of the total ordering principle, is exhibited that is provable in Si+11 (®), but unprov-able in Ti1(®). This is in contrast with the classical situation, where S i+1 2 is conservative over Ti2 w.r.t. § b i+1-sentences. The independence results are proved by translations into propositional logic, and using lower bounds for corresponding propositional proof systems
The ordering principle, which says that if there is an ordering on n elements then one of them must ...
One of the central open questions in bounded arithmetic is whether Buss'hierarchy of theories of bou...
We study the problems of deciding whether a relation definable by a first-order formula in linear ra...
The theories S i 1 (α) and T i 1 (α) are the analogues of Buss' relativized bounded arithmetic theor...
The use of Nepomnjaščǐi’s Theorem in the proofs of independence results for bounded arithmetic th...
In this article we prove preservation theorems for theories of bounded arithmetic. The following one...
We develop a method for establishing the independence of some \Sigma b i (ff)-formulas from S i 2...
by Buss [1], for i ≥ 1 they are closely related to computational complexity classes in the polynomia...
The ordering principle states that every finite linear order has a least element. We show that, in t...
Abstract: Samuel Buss showed that, under certain circumstances, adding the collection scheme for bou...
Title: Model constructions for bounded arithmetic Author: Michal Garlík Abstract: We study construct...
This paper discusses lower bounds for proof length, especially as measured by number of steps (infe...
We propose inference systems for binary relations with composition laws of the form $S\circ T\subset...
In this paper, we close the logical gap between provability in the logic BBI, which is the propositi...
Abstract. Separation logic is a spatial logic for reasoning locally about heap structures. A decidab...
The ordering principle, which says that if there is an ordering on n elements then one of them must ...
One of the central open questions in bounded arithmetic is whether Buss'hierarchy of theories of bou...
We study the problems of deciding whether a relation definable by a first-order formula in linear ra...
The theories S i 1 (α) and T i 1 (α) are the analogues of Buss' relativized bounded arithmetic theor...
The use of Nepomnjaščǐi’s Theorem in the proofs of independence results for bounded arithmetic th...
In this article we prove preservation theorems for theories of bounded arithmetic. The following one...
We develop a method for establishing the independence of some \Sigma b i (ff)-formulas from S i 2...
by Buss [1], for i ≥ 1 they are closely related to computational complexity classes in the polynomia...
The ordering principle states that every finite linear order has a least element. We show that, in t...
Abstract: Samuel Buss showed that, under certain circumstances, adding the collection scheme for bou...
Title: Model constructions for bounded arithmetic Author: Michal Garlík Abstract: We study construct...
This paper discusses lower bounds for proof length, especially as measured by number of steps (infe...
We propose inference systems for binary relations with composition laws of the form $S\circ T\subset...
In this paper, we close the logical gap between provability in the logic BBI, which is the propositi...
Abstract. Separation logic is a spatial logic for reasoning locally about heap structures. A decidab...
The ordering principle, which says that if there is an ordering on n elements then one of them must ...
One of the central open questions in bounded arithmetic is whether Buss'hierarchy of theories of bou...
We study the problems of deciding whether a relation definable by a first-order formula in linear ra...