Results 1 to 10 of about 155,122 (304)
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 +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
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
A Fragment of Dependence Logic Capturing Polynomial Time [PDF]
Logical Methods in Computer Science, 2014 In this paper we study the expressive power of Horn-formulae in dependence logic and show that they can express NP-complete problems. Therefore we define an even smaller fragment D-Horn* and show that over finite successor structures it captures the ...
Johannes Ebbing +3 more
doaj +2 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
On a Convex Logic Fragment for Learning and Reasoning [PDF]
IEEE Transactions on Fuzzy Systems, 2018 Accepted in IEEE Transactions on Fuzzy ...
Francesco Giannini +3 more
openalex +7 more sources
Logic programming in a fragment of intuitionistic linear logic [PDF]
Information and Computation, 2002 AbstractWhen logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal of the form D ⊃ G from the context (set of formulas) Γ leads to an attempt to prove the goal G in the extended context Γ ∪ {D}.
Joshua S. Hodas, Dale Miller
openalex +4 more sources
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
Decision procedure for a fragment of quantified branching temporal logic
Lietuvos Matematikos Rinkinys, 2002 There is not abstract.
Aida Pliuškevičienė
doaj +3 more sources
Logic Fragments: A Coordination Model Based on Logic Inference [PDF]
, 2015 Chemical-based coordination models have proven useful to engineer self-organising and self-adaptive systems. Formal assessment of emergent global behaviours in self-organising systems is still an issue, most of the time emergent properties are being analysed through extensive simulations.
Francesco Luca De Angelis +1 more
openalex +4 more sources