Sciweavers

1101 search results - page 9 / 221
» Forcing in proof theory
Sort
View
CSL
2009
Springer
14 years 2 months ago
Expanding the Realm of Systematic Proof Theory
Abstract. This paper is part of a general project of developing a systematic and algebraic proof theory for nonclassical logics. Generalizing our previous work on intuitionistic-su...
Agata Ciabattoni, Lutz Straßburger, Kazushig...
ASIAN
2006
Springer
133views Algorithms» more  ASIAN 2006»
13 years 11 months ago
Normal Proofs in Intruder Theories
Given an arbitrary intruder deduction capability, modeled as an inference system S and a protocol, we show how to compute an inference system bS such that the security problem for ...
Vincent Bernat, Hubert Comon-Lundh
CSL
2008
Springer
13 years 9 months ago
Model Transformations in Decidability Proofs for Monadic Theories
We survey two basic techniques for showing that the monadic second-order theory of a structure is decidable. In the first approach, one deals with finite fragments of the theory (g...
Wolfgang Thomas
DIAGRAMS
2010
Springer
13 years 8 months ago
An Attention Based Theory to Explore Affordances of Textual and Diagrammatic Proofs
Shimojima and Katagiri have demonstrated that diagrams reduce "inferential load" during reasoning by scaffolding visual-spatial aspects of memory. In response, we wondere...
Peter Coppin, Jim Burton, Stephen Hockema
MLQ
2006
68views more  MLQ 2006»
13 years 7 months ago
On the proof theory of type two functionals based on primitive recursive operations
This paper is a companion to work of Feferman, J
David Steiner, Thomas Strahm