Results 11 to 20 of about 1,803,872 (361)
Negational Fragment of Intuitionistic Control Logic [PDF]
Studia Logica, 2014 We investigate properties of monadic purely negational fragment of Intuitionistic Control Logic (ICL). This logic arises from Intuitionistic Propositional Logic (IPL) by extending language of IPL by additional new constant for falsum.
Glenszczyk, Anna
core +8 more sources
The interpolation theorem in fragments of logics [PDF]
Indagationes Mathematicae (Proceedings), 1981 AbstractIn the first part of this paper, we prove that there are continuously many fragments of intuitionistic propositional calculus (IpC) which fail to have the interpolation property, thereby extending a result of J.I. Zucker. Our proof makes use of the Rieger-Nishimura lattice.
Gerard R. Renardel de Lavalette
openalex +5 more sources
Algebraic logic for the negation fragment of classical logic [PDF]
Logic Journal of the IGPL, 2023 Abstract The general aim of this article is to study the negation fragment of classical logic within the framework of contemporary (Abstract) Algebraic Logic. More precisely, we shall find the three classes of algebras that are canonically associated with a logic in Algebraic Logic, i.e. we find the classes $\textrm{Alg}^*$, $\textrm{Alg}
Luciano J. González
openalex +4 more sources
Positive Fragments of Coalgebraic Logics [PDF]
Logical Methods in Computer Science, 2013 Positive modal logic was introduced in an influential 1995 paper of Dunn as the positive fragment of standard modal logic. His completeness result consists of an axiomatization that derives all modal formulas that are valid on all Kripke frames and are built only from atomic propositions, conjunction, disjunction, box and diamond.
Adriana Balan +2 more
openalex +9 more sources
Ultrafilters on words for a fragment of logic
Theoretical Computer Science, 2015 We give a method for specifying ultrafilter equations and identify their projections on the set of profinite words. Let B be the set of languages captured by first-order sentences using unary predicates for each letter, arbitrary uniform unary numerical predicates and a predicate for the length of a word. We illustrate our methods by giving ultrafilter
Mai Gehrke +2 more
openalex +3 more sources
A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic [PDF]
Journal of Logic and Computation, 2005 Lev D. Beklemishev +2 more
openalex +2 more sources
Modal meet-implication logic [PDF]
Logical Methods in Computer Science, 2022 We extend the meet-implication fragment of propositional intuitionistic logic with a meet-preserving modality. We give semantics based on semilattices and a duality result with a suitable notion of descriptive frame.
Jim de Groot, Dirk Pattinson
doaj +1 more source
InquiryFragmentalism allows incompatible facts to constitute reality in an absolute manner, provided that they fail to obtain together. In recent years, the view has been extensively discussed, with a focus on its formalisation in modeltheoretic terms. This paper focuses on three formalisations: Lipman’s approach, the subvaluationist interpretation, and a ...
Samuele Iaquinto +2 more
openalex +4 more sources
Fragmentation and logical omniscience [PDF]
Noûs, 2021 AbstractIt would be good to have a Bayesian decision theory that assesses our decisions and thinking according to everyday standards of rationality—standards that do not require logical omniscience (Garber, 1983; Hacking, 1967). To that end we develop a “fragmented” decision theory in which a single state of mind is represented by a family of credence ...
Adam Elga, Agustín Rayo
openaire +2 more sources
Existential Definability over the Subword Ordering [PDF]
Logical Methods in Computer Science, 2023 We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$, together with the (non-contiguous) subword ordering.
Pascal Baumann +3 more
doaj +1 more source