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 ...
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...
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 ...
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...
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...