Sciweavers

4978 search results - page 28 / 996
» Logical models of argument
Sort
View
FCT
2005
Springer
14 years 2 months ago
A Self-dependency Constraint in the Simply Typed Lambda Calculus
We consider terms of simply typed lambda calculus in which copy of a subterm may not be inserted to the argument of itself during the reduction. The terms form wide class which inc...
Aleksy Schubert
AIML
2008
13 years 10 months ago
Valentini's cut-elimination for provability logic resolved
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
Rajeev Goré, Revantha Ramanayake
TAPSOFT
1997
Springer
14 years 26 days ago
Traces of I/O-Automata in Isabelle/HOLCF
Abstract. This paper presents a formalization of nite and in nite sequences in domain theory carried out in the theorem prover Isabelle. The results are used to model the metatheor...
Olaf Müller, Tobias Nipkow
APAL
2008
104views more  APAL 2008»
13 years 8 months ago
Infinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. W...
Paul Blain Levy
SYNTHESE
2008
99views more  SYNTHESE 2008»
13 years 8 months ago
Public and private communication are different: results on relative expressivity
Dynamic Epistemic Logic (DEL) is the study of how to reason about knowledge, belief, and communication. This paper studies the relative expressivity of certain fragments of the DE...
Bryan Renne