3658 search results - page 163 / 732 » The logic of proofs, semantically |
96
Voted
CSR
2010
Springer
15 years 5 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â€...
92
Voted
CSL
2001
Springer
15 years 5 months ago
2001
Springer
In this paper we investigate the purely logical rule of term induction, i.e. induction deriving numerals instead of arbitrary terms. In this system it is not possible to bound the ...
112
click to vote
ESOP
2000
Springer
15 years 4 months ago
2000
Springer
We introduce graph reduction technology that implements functional languages with control, such as Scheme with call/cc, where continuations can be manipulated explicitly as values,...
106
click to vote
ROOM
2000
15 years 2 months ago
2000
In this paper we provide a systematic formal interpretation for most elements of the UML notation. This interpretation, in a structured temporal logic, enables precise analysis of...
99
Voted
SLOGICA
2008
15 years 20 days ago
2008
In the paper we explore the idea of describing Pawlak's rough sets using three-valued logic, whereby the value t corresponds to the positive region of a set, the value f -- to...