On Model Theory for Intuitionistic Bounded Arithmetic with Applications to Independence Results

1990 ◽  
pp. 27-47 ◽  
Author(s):  
Samuel R. Buss
Keyword(s):  
Model Theory ◽  
Bounded Arithmetic ◽  
Independence Results

Lifting independence results in bounded arithmetic

1999 ◽  
Vol 38 (2) ◽  
pp. 123-138 ◽  
Author(s):  
Mario Chiari ◽  
Jan Krajíček
Keyword(s):  
Bounded Arithmetic ◽  
Independence Results

scholarly journals A theory for Log-Space and NLIN versus co-NLIN

2003 ◽  
Vol 68 (4) ◽  
pp. 1082-1090
Author(s):  
Chris Pollett
Keyword(s):  
Linear Time ◽  
Bounded Arithmetic ◽  
Conservative Extension ◽  
Independence Results

AbstractThe use of Nepomnjaščiǐ's Theorem in the proofs of independence results for bounded arithmetic theories is investigated. Using this result and similar ideas, it is shown that at least one of S1 or TLS does not prove the Matiyasevich-Robinson-Davis-Putnam Theorem. It is also established that TLS does not prove a statement that roughly means nondeterministic linear time is equal to co-nondeterministic linear time. Here S1 is a conservative extension of the well-studied theory IΔ0 and TLS is a theory for LOGSPACE reasoning.

Model Theory and Modules

1988 ◽  
Author(s):  
M. Prest
Keyword(s):  
Model Theory
Sign in / Sign up

Export Citation Format

Share Document