Results 241 to 250 of about 2,726,344 (283)
Some of the next articles are maybe not open access.

A new deconstructive logic: linear logic

Journal of Symbolic Logic, 1997
AbstractThe main concern of this paper is the design of a noetherian and confluent normalization for LK2 (that is, classical second order predicate logic presented as a sequent calculus).The method we present is powerful: since it allows us to recover as fragments formalisms as seemingly different as Girard's LC and Parigot's λμ, FD ([10, 12, 32, 36]),
Schellinx, H., Danos, V., Joinet, J.-B.
openaire   +3 more sources

Logic and logics

1978
…since one never knows what will be the line of advance, it is always most rash to condemn what is not quite in the fashion of the moment. Russell 1906, cited in Rescher 1974 ‘Classical’ and ‘non-classical’ logics There are a great many formal logical systems. In fact, ever since the ‘classical’ logical apparatus was formulated, there have been
openaire   +1 more source

Intuitionistic Logic As Epistemic Logic

Synthese, 2001
Is intuitionism a variant of constructivism? If intuitionism is not constructivism, what is it? What do the intuitions of the genuine intuitionists add up to? Are their intentions reflected faithfully in Heyting's intuitionistic logic? What is the epistemic logic like, in which the distinction can be made and in which the correctly understood claims of
openaire   +1 more source

Abstract Logics, Logic Maps, and Logic Homomorphisms

Logica Universalis, 2007
What is a logic? Which properties are preserved by maps between logics? What is the right notion for equivalence of logics? In order to give satisfactory answers we generalize and further develop the topological approach of [4] and present the foundations of a general theory of abstract logics which is based on the abstract concept of a theory.
openaire   +1 more source

Equational Logic

IEEE Transactions on Computers, 1974
A combinational circuit realizing the switching function f(x) may be regarded as a solution verifier for the Boolean equation f(x) = 1. (*) The output of the circuit is 1, that is, if and only if the input-vector x is a solution for (*). We use the term "equational logic" to denote an approach to circuit synthesis based on (*) rather than on the ...
openaire   +2 more sources

Invariant Logics

MLQ, 2002
In a previous paper, the author analyzed the groups of automorphisms of various lattices of modal logics. In this paper he goes on with the study of the structure of the group of automorphisms of the lattice NExtK (the distributive lattice of normal logics). In this way, he studies logics which are invariant under all automorphisms in the group.
openaire   +3 more sources

Product Logic, Gödel Logic (and Boolean Logic)

1998
We are going to investigate the second of the three most important prepositional calculi, namely PC(*II) where *II is the product t-norm; we shall call this logic just the product logic and denote it by II. Recall that the corresponding implication is Goguen and the corresponding negation is Godel negation (cf. 2.1.11,2.1.17).
openaire   +1 more source

Logic and Quantum Logic

1976
Strict analysis of quantum theory has shown that for certain propositions about quantum-mechanical systems some laws of logic lose their validity. This assertion is justified by pointing out that quantum mechanics is an empirically verified theory.
openaire   +1 more source

Logic, Logic, and Logic

History and Philosophy of Logic, 2000
openaire   +1 more source

Home - About - Disclaimer - Privacy