551 search results - page 38 / 111 » Realizability of Real-Time Logics |
148
click to vote
CSL
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Church's Problem (1962) asks for the construction of a procedure which, given a logical specification on sequence pairs, realizes for any input sequence X an output...
143
click to vote
CSR
2006
Springer
15 years 10 months ago
2006
Springer
The logic of proofs is known to be complete for the semantics of proofs in PA. In this paper we present a refinement of this theorem, we will show that we can assure that all the ...
155
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We refine HO/N game semantics with an additional notion of pointer (mu-pointers) and extend it to first-order classical logic with completeness results. We use a Church style exte...
149
click to vote
APAL
2005
15 years 6 months ago
2005
A new semantics is presented for the logic of proofs (LP), [1, 2], based on the intuition that it is a logic of explicit knowledge. This semantics is used to give new proofs of se...
155
click to vote
CSR
2010
Springer
15 years 11 months ago
2010
Springer
By terms-allowed-in-types capacity, the Logic of Proofs LP includes formulas of the form t : Ï•(t), which have self-referential meanings. In this paper, “prehistoric phenomenaâ€...