Results 301 to 310 of about 2,358,795 (346)

Active Shielding of MWCNT Bundle Interconnects: An Efficient Approach to Cancellation of Crosstalk-Induced Functional Failures in Ternary Logic

IEEE transactions on electromagnetic compatibility (Print), 2019
This study presents an efficient geometry for active shielding of multiwalled carbon nanotube (MWCNT) bundle interconnects which cancels the crosstalk-induced functional failures in ternary logic.
Maryam Rezaei Khezeli, Mohammad Hossein Moaiyeri, A. Jalali   +2 more
semanticscholar   +1 more source

Proof analysis in intermediate logics

Archive for Mathematical Logic, 2011
Using labelled formulae, a cut-free sequent calculus for intuitionistic propositional logic is presented, together with an easy cut-admissibility proof; both extend to cover, in a uniform fashion, all intermediate logics characterised by frames satisfying conditions expressible by one or more geometric implications.
Dyckhoff R., Negri S.
openaire   +2 more sources

On finite approximability of ?-intermediate logics [PDF]

Studia Logica, 1982
The aim of this note is to show (Theorem 1.6) that in each of the cases: ψ= {→, ∨ }, or {→, ∨, ∧ }, or {→, ∨, ℸ } there are uncountably many ψ-intermediate logics which are not finitely approximable. This result together with the results known in literature allow us to conclude (Theorem 2.2) that for each ψ: either all ψ-intermediate logics are ...
openaire   +2 more sources

Applications of trees to intermediate logics

Journal of Symbolic Logic, 1972
We investigate extensions of Heyting's predicate calculus (HPC). We relate geometric properties of the trees of Kripke models (see [2]) with schemas of HPC and thus obtain completeness theorems for several intermediate logics defined by schemas. Our main results are:(a) ∼(∀x ∼ ∼ϕ(x) Λ ∼∀xϕ(x)) is characterized by all Kripke models with trees T with the
openaire   +2 more sources

Counting the maximal intermediate constructive logics

Journal of Symbolic Logic, 1993
AbstractA proof is given that the set of maximal intermediate propositional logics with the disjunction property and the set of maximal intermediate predicate logics with the disjunction property and the explicit definability property have the power of continuum.
FERRARI, MAURO, MIGLIOLI P.
openaire   +3 more sources

Hypersequents, logical consequence and intermediate logics for concurrency

Annals of Mathematics and Artificial Intelligence, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Intermediate predicate logics determined by ordinals

Journal of Symbolic Logic, 1990
AbstractFor each ordinal α > 0, L(α) is the intermediate predicate logic characterized by the class of all Kripke frames with the poset α and with constant domain. This paper will be devoted to a study of logics of the form L(α). It will be shown that for each uncountable ordinal of the form α + η with a finite or a countable η(> 0), there exists
MINARI, PIERLUIGI, M. Takano, H. Ono
openaire   +3 more sources

Three Intermediate Logics

1981
We saw in previous chapters the following properties of h: (1) h is complete for the class of all finite trees (2) h + is complete for the class of all finite n-ary trees, for any n≥2. (3) h is complete for the infinite full binary tree.
openaire   +2 more sources

The theory of intermediate quantifiers in fuzzy natural logic revisited and the model of "Many"

Fuzzy Sets Syst., 2020
Petra Murinová, V. Novák
semanticscholar   +1 more source

On Extensions of Intermediate Logics by Strong Negation

Journal of Philosophical Logic, 1998
The structure \({\mathcal E} {\mathbf N}\) of extensions of Nelson logic \(N\) (intuitionistic logic with strong negation) and its correlations with the structure \({\mathcal E} {\mathbf {Int}}\) of intermediate logics is studied. The mapping from \(\Lambda\) to \(n( \Lambda) = N + \Lambda \) is an embedding of the complete lattice \({\mathcal E ...
openaire   +3 more sources