Sciweavers

827 search results - page 102 / 166
» Proof-Theoretic Soundness and Completeness
Sort
View
LOGCOM
2010
124views more  LOGCOM 2010»
14 years 11 months ago
Analytic Methods for the Logic of Proofs
The logic of proofs (LP) was proposed as Gödel’s missed link between Intuitionistic and S4-proofs, but so far the tableau-based methods proposed for LPhave not explored this cl...
Marcelo Finger
89
Voted
LOGCOM
2010
123views more  LOGCOM 2010»
14 years 11 months ago
The Hyper Tableaux Calculus with Equality and an Application to Finite Model Computation
In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in ...
Peter Baumgartner, Ulrich Furbach, Björn Pelz...
78
Voted
LOGCOM
2010
83views more  LOGCOM 2010»
14 years 11 months ago
Syllogistic Logics with Verbs
This paper provides sound and complete logical systems for several fragments of English which go beyond syllogistic logic in that they use verbs as well as other limited syntactic...
Lawrence S. Moss
101
Voted
LOGCOM
2010
82views more  LOGCOM 2010»
14 years 11 months ago
Deduction Systems for Coalgebras Over Measurable Spaces
A theory of infinitary deduction systems is developed for the modal logic of coalgebras for measurable polynomial functors on the category of measurable spaces. These functors ha...
Robert Goldblatt
CORR
2010
Springer
130views Education» more  CORR 2010»
14 years 10 months ago
Interactive Learning Based Realizability and 1-Backtracking Games
Abstract. We prove that interactive learning based classical realizability (introduced by Aschieri and Berardi for first order arithmetic [1]) is sound with respect to Coquand game...
Federico Aschieri