Results 1  10
of
6,440
Classical logic = MLL + Superposition
, 2005
"... Syntactically, classical logic decomposes thus [Gir87]: ..."
Classical Logic
, 2014
"... He who is unable to live in society, or who has no need because he is sufficient for himself, must either be a god or a beast. 1. ∀x [(U(x) or S(x)) → (G (x) or B(x))]. e is a le t live i s ciety,e ho e a go or a east. s fficie t f r i self, st eit er 2. not G (a) and not B(a). 3. not U(a) and not ..."
Abstract
 Add to MetaCart
He who is unable to live in society, or who has no need because he is sufficient for himself, must either be a god or a beast. 1. ∀x [(U(x) or S(x)) → (G (x) or B(x))]. e is a le t live i s ciety,e ho e a go or a east. s fficie t f r i self, st eit er 2. not G (a) and not B(a). 3. not U(a) and not S(a).
Classical Logic and Computation
, 2000
"... This thesis contains a study of the proof theory of classical logic and addresses the problem of giving a computational interpretation to classical proofs. This interpretation aims to capture features of computation that go beyond what can be expressed in intuitionisticlogic. We introduce several ..."
Abstract

Cited by 73 (7 self)
 Add to MetaCart
This thesis contains a study of the proof theory of classical logic and addresses the problem of giving a computational interpretation to classical proofs. This interpretation aims to capture features of computation that go beyond what can be expressed in intuitionisticlogic. We introduce
Split of Classical Logic (draft)
"... Abstract Classical logic contains intuitionistic and paraconsistent logics. This study clarifies that proofs in classical logic are not intricately interwined with intuitionistic and paraconsistent proofs, that is, there exists a constructive procedure of extracting intuitionistic and paraconsisten ..."
Abstract
 Add to MetaCart
Abstract Classical logic contains intuitionistic and paraconsistent logics. This study clarifies that proofs in classical logic are not intricately interwined with intuitionistic and paraconsistent proofs, that is, there exists a constructive procedure of extracting intuitionistic
Quantum Logic as Classical Logic∗
, 2014
"... We propose a semantic representation of the standard quantum logic QL within a classical, normal modal logic, and this via a latticeembedding of orthomodular lattices into Boolean algebras with one modal operator. Thus our classical logic is a completion of the quantum logic QL. In other words, we ..."
Abstract
 Add to MetaCart
We propose a semantic representation of the standard quantum logic QL within a classical, normal modal logic, and this via a latticeembedding of orthomodular lattices into Boolean algebras with one modal operator. Thus our classical logic is a completion of the quantum logic QL. In other words, we
Intuitionistic Choice and Classical Logic
 Arch. Math. Logic
, 1997
"... this paper we show how to combine the unrestricted countable choice, induction on infinite wellfounded trees and restricted classical logic in a constructively given model. For readers faniliar with intuitionistic systems [14], we may succinctly describe the theory we interpret as follows. Expand t ..."
Abstract

Cited by 17 (4 self)
 Add to MetaCart
this paper we show how to combine the unrestricted countable choice, induction on infinite wellfounded trees and restricted classical logic in a constructively given model. For readers faniliar with intuitionistic systems [14], we may succinctly describe the theory we interpret as follows. Expand
Kripke Models for Classical Logic
, 2010
"... We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cutfree completeness. We discuss the novelty of the notion and its potential applications. ..."
Abstract
 Add to MetaCart
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cutfree completeness. We discuss the novelty of the notion and its potential applications.
Kripke Models for Classical Logic
"... We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cutfree completeness. We discuss the novelty of the notion and its potential applications. ..."
Abstract
 Add to MetaCart
We introduce a notion of Kripke model for classical logic for which we constructively prove soundness and cutfree completeness. We discuss the novelty of the notion and its potential applications.
Computational Content of Classical Logic
 SEMANTICS AND LOGICS OF COMPUTATION
, 1996
"... This course is an introduction to the research trying to connect the proof theory of classical logic and computer science. We omit important and standard topics, among them the connection between the computational interpretation of classical logic and the programming operator callcc. Instead, here ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
This course is an introduction to the research trying to connect the proof theory of classical logic and computer science. We omit important and standard topics, among them the connection between the computational interpretation of classical logic and the programming operator callcc. Instead
Results 1  10
of
6,440