Sciweavers

LOGCOM
2016
8 years 18 days ago
Paraconsistent set theory by predicating on consistency
This paper intends to contribute to the debate about the uses of paraconsistent reasoning in the foundations of set theory, by means of employing the logics of formal inconsistenc...
Walter Alexandre Carnielli, Marcelo E. Coniglio
LOGCOM
2016
8 years 18 days ago
Spoiled for choice?
The transition from a theory that turned out trivial to a consistent replacement need not proceed in terms of inconsistencies, which are negation gluts. Logics that tolerate gluts...
Diderik Batens
LOGCOM
2016
8 years 18 days ago
An open logical framework
The LFP Framework is an extension of the Harper-Honsell-Plotkin’s Edinburgh Logical Framework LF with external predicates, hence the name Open Logical Framework. This is accompli...
Furio Honsell, Marina Lenisa, Ivan Scagnetto, Luig...
LOGCOM
2016
8 years 18 days ago
Nested sequent calculi for normal conditional logics
Nested sequent calculi are a useful generalization of ordinary sequent calculi, where sequents are allowed to occur within sequents. Nested sequent calculi have been profitably e...
Régis Alenda, Nicola Olivetti, Gian Luca Po...
LOGCOM
2016
8 years 18 days ago
Universality in two dimensions
Turing, in his immortal 1936 paper, observed that “[human] computing is normally done by writing. . . symbols on [two-dimensional] paper”, but noted that use of a second dimen...
Nachum Dershowitz, Gilles Dowek
Programming Languages
Top of PageReset Settings