Results 251 to 260 of about 13,558 (288)

Implicational Paradoxes and the Meaning of Logical Constants

open access: yesAustralasian Journal of Philosophy, 2007
I discuss paradoxes of implication in the setting of a proof-conditional theory of meaning for logical constants. I argue that a proper logic of implication should be not only relevant, but also constructive and nonmonotonic. This leads me to
Francesco Paoli
exaly   +2 more sources
Some of the next articles are maybe not open access.

Related searches:

Constant Delay Logic Style

IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2013
A constant delay (CD) logic style is proposed in this paper, targeting at full-custom high-speed applications. The CD characteristic of this logic style regardless of the logic type makes it suitable in implementing complicated logic expressions such as addition.
Pierce Chuang   +2 more
openaire   +1 more source

Pseudo-constant logic optimization

2013 IEEE 24th International Conference on Application-Specific Systems, Architectures and Processors, 2013
Constant folding reduces area and enables greater parallelism, but requires circuits with constant inputs. In this work, we extend constant folding to support pseudo-constants, which are values that change with low frequency. We present a method of pseudo-constant logic optimization based on dynamically reconfigurable capabilities of FPGAs, which ...
Aaron Landy, Greg Stitt
openaire   +1 more source

On Łukasiewicz Logic with Truth Constants

2007
Canonical completeness results for Ł\((\mathcal{C})\), the expansion of Łukasiewicz logic Ł with a countable set of truth-constants \(\mathcal{C}\), have been recently proved in [5] for the case when the algebra of truth constants \(\mathcal{C}\) is a subalgebra of the rational interval [0, 1] ∩ ℚ. The case when \(C \not \subseteq [0, 1] \cap \mathbb{Q}
Roberto Cignoli   +2 more
openaire   +1 more source

Logical constants

2018
A fundamental problem in the philosophy of logic is to characterize the concepts of ‘logical consequence’ and ‘logical truth’ in such a way as to explain what is semantically, metaphysically or epistemologically distinctive about them. One traditionally says that a sentence p is a logical consequence of a set S of sentences in a language L if and only ...
openaire   +1 more source

The Meanings of the Logical Constants in Deontic Logic

Ratio Juris, 1999
If deontic logic is to cast light on any of the normative sciences, such as legal reasoning, then certain problems regarding its logical constants must be faced. Recent studies in the area of deontic logic have tended to assume that it is our responses to the “paradoxes” of deontic implication which are fundamental to resolving problems with the use of
openaire   +1 more source

Logical Form and Logical Constants

2000
Abstract A general characterization of the constants of standard logic is achieved by following the suggestion, inspired by Wittgenstein's Tractatus, that the meanings of these constants can be fully explained by reference to no more than two essential features of empirical statements; all such statements must possess excluding power and
openaire   +1 more source

A CONSTRUCTIVE INTERPRETATION OF THE LOGICAL CONSTANTS

The Bulletin of Symbolic Logic
Abstract Heyting’s intuitionistic predicate logic describes very general regularities observed in constructive mathematics. The intended meaning of the logical constants is clarified through Heyting’s proof interpretation. A re-evaluation of proof interpretation and predicate logic leads to the new constructive Basic logic properly ...
Mohammad Ardeshir, Wim Ruitenburg
openaire   +1 more source

A New Constant in Superintuitionistic Logic L3

Algebra and Logic, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Constants in Kripke Models for Intuitionistic Logic

Mathematical Logic Quarterly, 1995
AbstractWe present a technique to extend a Kripke structure (for intuitionistic logic) into an elementary extension satisfying some property (cardinality, saturation, etc.) which can be “axiomatized” by a family of sets of sentences, where, most often, many constant symbols occur. To that end, we prove extended theorems of completeness and compactness.
openaire   +2 more sources

Home - About - Disclaimer - Privacy