中文
相关论文

相关论文: An implication in orthologic

200 篇论文

A logic calculus is presented that is a conservative extension of linear logic. The motivation beneath this work concerns lazy evaluation, true concurrency and interferences in proof search. The calculus includes two new connectives to deal…

计算机科学中的逻辑 · 计算机科学 2007-06-25 Christophe Fouqueré

In the present article, we explore a new approach for the study of orthomodular lattices, where we replace the problematic conjunction by a binary operator, called the Sasaki projection. We present a characterization of orthomodular…

计算机科学中的逻辑 · 计算机科学 2007-05-23 Olivier Brunet

We prove that a tolerance relation of a lattice is a homomorphic image of a congruence relation.

环与代数 · 数学 2022-08-09 Gábor Czédli , George Grätzer

Effect algebras were introduced in order to describe the structure of effects, i.e. events in quantum mechanics. They are partial algebras describing the logic behind the corresponding events. It is natural to ask how to introduce the…

逻辑 · 数学 2023-03-22 Ivan Chajda , Helmut Länger

The development of logic has largely been through the 'deductive' paradigm: conclusions are inferred from established premisses. However, the use of logic in the context of both human and machine reasoning is typically through the dual…

计算机科学中的逻辑 · 计算机科学 2025-04-29 Alexander V. Gheorghiu , David J. Pym

Ontologies formalise how the concepts from a given domain are interrelated. Despite their clear potential as a backbone for explainable AI, existing ontologies tend to be highly incomplete, which acts as a significant barrier to their more…

人工智能 · 计算机科学 2021-05-12 Steven Schockaert , Yazmín Ibáñez-García , Víctor Gutiérrez-Basulto

We study different representation theorems for various reducts of Heyting polyadic algebras. Superamalgamation is proved for several (natural reducts) and our results are compared to the finitizability problem in classical algebraic logic…

逻辑 · 数学 2013-04-08 Tarek Sayed Ahmed

It is proved that every prevariety of algebras is categorically equivalent to a "prevariety of logic", i.e., to the equivalent algebraic semantics of some sentential deductive system. This allows us to show that no nontrivial equation in…

逻辑 · 数学 2019-02-13 T. Moraschini , J. G. Raftery

We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time…

计算复杂性 · 计算机科学 2017-04-20 Jean-Yves Moyen , Jakob Grue Simonsen

Tarski gave a general semantics for deductive reasoning: a formula a may be deduced from a set A of formulas iff a holds in all models in which each of the elements of A holds. A more liberal semantics has been considered: a formula a may…

人工智能 · 计算机科学 2007-05-23 Daniel Lehmann

In this paper we investigate two logics from an algebraic point of view. The two logics are: MALL (multiplicative-additive Linear Logic) and LL (classical Linear Logic). Both logics turn out to be strongly algebraizable in the sense of Blok…

逻辑 · 数学 2023-06-06 Paolo Aglianò

In this paper we show several similarities among logic systems that deal simultaneously with deductive and quantitative inference. We claim it is appropriate to call the tasks those systems perform as Quantitative Logic Reasoning. Analogous…

计算机科学中的逻辑 · 计算机科学 2019-05-15 Marcelo Finger

In recent work, we introduced a new semantics for conditionals, covering a large class of what we call preconditionals. In this paper, we undertake an axiomatic study of preconditionals and subclasses of preconditionals. We then prove that…

逻辑 · 数学 2025-08-29 Wesley H. Holliday

We give a proof-theoretic as well as a semantic characterization of a logic in the signature with conjunction, disjunction, negation, and the universal and existential quantifiers that we suggest has a certain fundamental status. We present…

逻辑 · 数学 2023-04-06 Wesley H. Holliday

We show a model construction for a system of higher-order illative combinatory logic $\mathcal{I}_\omega$, thus establishing its strong consistency. We also use a variant of this construction to provide a complete embedding of first-order…

逻辑 · 数学 2016-07-12 Łukasz Czajka

The Aristotelian syllogistic cannot account for the validity of many inferences involving relational facts. In this paper, we investigate the prospects for providing a relational syllogistic. We identify several fragments based on (a)…

计算机科学中的逻辑 · 计算机科学 2024-04-24 Ian Pratt-Hartmann , Lawrence S. Moss

A finitary propositional logic can be given an algebraic reading in two different ways: by translating formulas into equations and logical rules into quasi-equations, or by translating logical rules directly into equations. The former type…

逻辑 · 数学 2024-01-23 Michele Pra Baldi , Adam Přenosil

We give an algebraic proof of the criterion for hereditary structural completeness of an intermediate logic, or, equivalently, of the primitiveness of a variety of Heyting algebras.

逻辑 · 数学 2025-12-08 Alex Citkin

In the present paper we discuss the lattice of reducts of $\langle \mathbb{Q}, \{$+$\} \rangle$

逻辑 · 数学 2019-01-15 A. L. Semenov , S. F. Soprunov

In this paper we intend to study implications in their most general form, generalizing different classes of implications including the Heyting implication, sub-structural implications and weak strict implications. Following the topological…

逻辑 · 数学 2020-04-23 Amirhossein Akbar Tabatabai