Results 51 to 60 of about 47,777 (170)
Intermediate Logics and Visser's Rules
Notre Dame Journal of Formal Logic, 2005 A set \(R\) of admissible rules forms a basis of admissible rules for a logic \(L\) if all the admissible rules of \(L\) can be derived from \(R\). It was proved by the author [J. Symb. Log. 66, 281--294 (2001; Zbl 0986.03013)] that the so-called Visser's rules form a basis of admissible rules for the intuitionistic propositional calculus \textbf{IPC}.
openaire +4 more sources
On an Application of Intermediate Logics [PDF]
Nagoya Mathematical Journal, 1960 In [1] I investigated some logics intermediate between intuitionistic and classical predicate logics. The purpose of this paper is to show the possibility of applying some intermediate logics to mathematics namely, to show that some mathematical theorems which are provable in the classical logic but not provable in the intuitionistic logic are provable
openaire +3 more sources
Tabular Intermediate Logics Comparison
Tabular intermediate logics are intermediate logics characterized by finite posets treated as Kripke frames. For a poset $\mathbb{P}$, let $L(\mathbb{P})$ denote the corresponding tabular intermediate logic. We investigate the complexity of the following decision problem $\mathsf{LogContain}$: given two finite posets $\mathbb P$ and $\mathbb Q$, decide
Paweł Rzążewski, Michał Stronkowski
openaire +2 more sources
Sequent Calculus in the Topos of Trees
, 2015 Nakano's "later" modality, inspired by G\"{o}del-L\"{o}b provability logic, has been applied in type systems and program logics to capture guarded recursion. Birkedal et al modelled this modality via the internal logic of the topos of trees. We show that
A. Bizjak +13 more
core +1 more source
Computable Kripke Models and Intermediate Logics
Information and Computation, 1998 In the paper under review the authors investigate effectiveness of Kripke models for first-order theories of intermediate logics, i.e. those that lie between intuitionistic and classical predicate logic. Completeness (by Kripke) results for intermediate logics such as intuitionistic logic, classical logic, constant domain logic, directed frames logic ...
Ishihara, Hajime +2 more
openaire +1 more source
Model-checking Quantitative Alternating-time Temporal Logic on One-counter Game Models [PDF]
, 2014 We consider quantitative extensions of the alternating-time temporal logics ATL/ATLs called quantitative alternating-time temporal logics (QATL/QATLs) in which the value of a counter can be compared to constants using equality, inequality and modulo ...
Vester, Steen
core +1 more source
Learning of Human-like Algebraic Reasoning Using Deep Feedforward Neural Networks
, 2017 There is a wide gap between symbolic reasoning and deep learning. In this research, we explore the possibility of using deep learning to improve symbolic reasoning.
Cai, Cheng-Hao +3 more
core +1 more source
Prefinitely axiomatizable modal and intermediate logics [PDF]
Mathematical Logic Quarterly, 1993 AbstractA logic Λ bounds a property P if all proper extensions of Λ have P while Λ itself does not. We construct logics bounding finite axiomatizability and logics bounding finite model property in the lattice of intermediate logics and in the lattice of normal extensions of K4.3. MSC: 03B45, 03B55.
openaire +3 more sources
Reflexive Intermediate Propositional Logics
Notre Dame Journal of Formal Logic, 2006 Which intermediate propositional logics can prove their own completeness? I call a logic reflexive if a second-order metatheory of arithmetic created from the logic is sufficient to prove the completeness of the original logic. Given the collection of intermediate propositional logics, I prove that the reflexive logics are exactly those that are at ...
openaire +2 more sources
Almost structural completeness; an algebraic approach [PDF]
, 2014 A deductive system is structurally complete if its admissible inference rules are derivable. For several important systems, like modal logic S5, failure of structural completeness is caused only by the underivability of passive rules, i.e. rules that can
M. Stronkowski, Michał, Wojciech Dzik
core