Results 21 to 30 of about 38,385 (299)
Some results on intermediate constructive logics. [PDF]
Notre Dame Journal of Formal Logic, 1989 Some techniques for the study of intermediate constructive logics are illustrated. In particular a general characterization is given of maximal constructive logics from which a new proof of the maximality of MV (Med- vedev's logic of finite problems ) can be obtained.
Pierangelo Miglioli +4 more
openalex +4 more sources
Some Results on the Intermediate Logics
Publications of the Research Institute for Mathematical Sciences, 1972 In ClOj, we developed the method of Kripke models and gave some applications of it to the study of the intermediate logics. We found that the use of Kripke models is very efficient, since in many cases the algebraic structure of Kripke models reflects well the properties of the logics characterized by them.
Hiroakira Ono
openalex +4 more sources
EPSILON THEOREMS IN INTERMEDIATE LOGICS [PDF]
The Journal of Symbolic Logic, 2022 AbstractAny intermediate propositional logic (i.e., a logic including intuitionistic logic and contained in classical logic) can be extended to a calculus with epsilon- and tau-operators and critical formulas. For classical logic, this results in Hilbert’s $\varepsilon $ -calculus.
MATTHIAS BAAZ, RICHARD ZACH
openaire +2 more sources
A Study of Intermediate Predicate Logics
Publications of the Research Institute for Mathematical Sciences, 1972 Hiroakira Ono
openalex +4 more sources
A Note on Gödel-Dummet Logic LC
Bulletin of the Section of Logic, 2021 Let Ao, A1, . . . , An be (possibly) distintict wffs, being an odd number equal to or greater than 1. Intuitionistic Propositional Logic IPC plus the axiom (Ao → A1)V . . .V(An-1 → An)V(An → Ao) is equivalent to Gödel-Dummett logic LC.
Gemma Robles, José M. Méndez
doaj +1 more source
UNIFICATION IN INTERMEDIATE LOGICS [PDF]
The Journal of Symbolic Logic, 2015 AbstractThis paper contains a proof–theoretic account of unification in intermediate logics. It is shown that many existing results can be extended to fragments that at least contain implication and conjunction. For such fragments, the connection between valuations and most general unifiers is clarified, and it is shown how from the closure of a ...
Iemhoff, R., Roziere, P.
openaire +3 more sources
Automatic Function Annotations for Hoare Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 In systems verification we are often concerned with multiple, inter-dependent properties that a program must satisfy. To prove that a program satisfies a given property, the correctness of intermediate states of the program must be characterized. However,
Daniel Matichuk
doaj +1 more source
Kripke completeness for intermediate logics
, 2000 The thesis studies problems in model theory for nonclassical logics, more specifically, for intermediate propositional logics. This area was opened in the 1930s by the well-known works of Gödel and Tarski and has now evolved into an interesting and complex mathematical field, with a strong trend to Computer Science applications.
Camillo Fiorentini
openalex +4 more sources
Graphene/Ferroelectric (Ge-Doped HfO2) Adaptable Transistors Acting as Reconfigurable Logic Gates
Nanomaterials, 2022 We present an array of 225 field-effect transistors (FETs), where each of them has a graphene monolayer channel grown on a 3-layer deposited stack of 22 nm control HfO2/5 nm Ge-HfO2 intermediate layer/8 nm tunnel HfO2/p-Si substrate.
Mircea Dragoman +5 more
doaj +1 more source
Reconfigurable Logic Controller—Direct FPGA Synthesis Approach
Applied Sciences, 2021 Programmable logic controllers are commonly used in automation systems. Continuously growing demands result in the growth of control program complexity.
Adam Milik, Marcin Kubica, Dariusz Kania
doaj +1 more source