Sciweavers

39 search results - page 5 / 8
» jsyml 2007
Sort
View
JSYML
2007
88views more  JSYML 2007»
13 years 9 months ago
The basic intuitionistic logic of proofs
The language of the basic logic of proofs extends the usual propositional language by forming sentences of the sort x is a proof of F for any sentence F. In this paper a complete ...
Sergei N. Artëmov, Rosalie Iemhoff
JSYML
2007
106views more  JSYML 2007»
13 years 9 months ago
Characterizing rosy theories
We examine several conditions, either the existence of a rank or a particular property of þ-forking that suggest the existence of a well-behaved independence relation, and determi...
Clifton Ealy, Alf Onshuus
JSYML
2010
58views more  JSYML 2010»
13 years 4 months ago
On Tao's "finitary" infinite pigeonhole principle
In 2007, Terence Tao wrote on his blog an essay about soft analysis, hard analysis and the finitization of soft analysis statements into hard analysis statements. One of his main ...
Jaime Gaspar, Ulrich Kohlenbach
JSYML
2007
85views more  JSYML 2007»
13 years 9 months ago
Lower bounds for modal logics
We give an exponential lower bound on number of proof-lines in the proof system K of modal logic, i.e., we give an example of K-tautologies 1, 2, . . . s.t. every K-proof of i must...
Pavel Hrubes
JSYML
2007
62views more  JSYML 2007»
13 years 9 months ago
A reduction of the NF consistency problem
We give a necessary and sufficient condition in order that a typeshifting automorphism be constructed on a model of the Theory of Simple Types (TST) by forcing. Namely it is prove...
Athanassios Tzouvaras