English
Related papers

Related papers: Adding an Implication to Logics of Perfect Paradef…

200 papers

The article proposes a new technique for proving the undefinability of logical connectives through each other and illustrates the technique with several examples. Some of the obtained results are new proofs of the existing theorems, others…

Artificial Intelligence · Computer Science 2023-07-04 Sophia Knight , Pavel Naumov , Qi Shi , Vigasan Suntharraj

It is well-known that intuitionistic logics can be formalized by means of Brouwerian semilattices, i.e. relatively pseudocomplemented semilattices. Then the logical connective implication is considered to be the relative pseudocomplement…

Logic · Mathematics 2023-01-06 Ivan Chajda , Helmut Länger

Effect algebras form an algebraic formalization of the logic of quantum mechanics. For lattice effect algebras E we investigate a natural implication and prove that the implication reduct of E is term equivalent to E. Then we present a…

Logic · Mathematics 2020-01-22 Ivan Chajda , Radomír Halaš , Helmut Länger

The Umehara algebra is studied with motivation on the problem of the non-existence of common complex submanifolds. In this paper, we prove some new results in Umehara algebra and obtain some applications. In particular, if a complex…

Complex Variables · Mathematics 2022-11-03 Xu Zhang , Donghai Ji

The set of associative and commutative hypercomplex numbers, called the perfect hypercomplex algebra (PHA) is investigated. Necessary and sufficient conditions for an algebra to be a PHA via semi-tensor product(STP) of matrices are…

Rings and Algebras · Mathematics 2021-05-10 Daizhan Cheng , Zhengping Ji

We show that if we enrich first order logic by allowing quantification over isomorphisms between definable ordered fields the resulting logic, L(Q_{Of}), is fully compact. In this logic, we can give standard compactness proofs of various…

Logic · Mathematics 2016-09-06 Alan H. Mekler , Saharon Shelah

Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noetherity, L\"ob's formula, absence of infinite iteration, absence of divergence and normalisation. The study is based on modal semirings,…

Logic in Computer Science · Computer Science 2015-07-01 Desharnais Jules , Bernhard Moeller , Struth Georg

To every minimal model of a complete local isolated cDV singularity Donovan--Wemyss associate a finite dimensional symmetric algebra known as the contraction algebra. We construct the first known standard derived equivalences between these…

Representation Theory · Mathematics 2020-02-11 Jenny August

It is well-known that a Hilbert-style deduction system for first-order classical logic is sound and complete for a model theory built using all Boolean algebras as truth-value algebras if and only if it is sound and complete for a model…

Logic · Mathematics 2016-06-21 Richard DeJonghe , Kimberly Frey , Tom Imbo

G3-style sequent calculi for the logics in the cube of non-normal modal logics and for their deontic extensions are studied. For each calculus we prove that weakening and contraction are height-preserving admissible, and we give a syntactic…

Logic · Mathematics 2020-02-20 Eugenio Orlandelli

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. As a consequence we…

Logic · Mathematics 2023-06-22 Jim de Groot , Dirk Pattinson

The implication relationship between subsystems in Reverse Mathematics has an underlying logic, which can be used to deduce certain new Reverse Mathematics results from existing ones in a routine way. We use techniques of modal logic to…

Logic · Mathematics 2015-04-21 Carl Mummert , Alaeddine Saadaoui , Sean Sovine

It is well known that there is a correspondence between sets and complete, atomic Boolean algebras (CABA's) taking a set to its power-set and, reciprocally, a complete, atomic Boolean algebra to its set of atomic elements. Of course, such a…

Category Theory · Mathematics 2022-09-20 Marcelo E. Coniglio , Guilherme V. Toledo

In the literature on Kleene algebra (KA), a number of variants have been proposed such as Kleene algebra with tests, commutative KA, bi-KA, and concurrent KA. The equational theories of some of these structures have then been studied in the…

Logic in Computer Science · Computer Science 2026-05-19 Lukas Mulder , Damien Pous , Jana Wagemaker

We present a family of paraconsistent counterparts of the constructive modal logic CK. These logics aim to formalise reasoning about contradictory but non-trivial propositional attitudes like beliefs or obligations. We define their…

Logic in Computer Science · Computer Science 2025-08-26 Han Gao , Daniil Kozhemiachenko , Nicola Olivetti

We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…

Logic · Mathematics 2015-12-15 Justin Brody

Covering Algebras of extended affine Lie algebras(EALA's) relative to finite order automorphisms are studied. Conditions are given for when the resulting algebra is again an EALA. This paper deals with affinizations of EALA's relative to…

Quantum Algebra · Mathematics 2007-05-23 Bruce Allison , Stephen Berman , Arturo Pianzola

In the present paper, we propose Abstract Algebraic Logic (AAL) as a general logical framework for Judgment Aggregation. Our main contribution is a generalization of Herzberg's algebraic approach to characterization results in on judgment…

Logic in Computer Science · Computer Science 2016-03-29 Maria Esteban , Alessandra Palmigiano , Zhiguang Zhao

The notion of an F-manifold algebra is the underlying algebraic structure of an $F$-manifold. We introduce the notion of pre-Lie formal deformations of commutative associative algebras and show that F-manifold algebras are the corresponding…

Rings and Algebras · Mathematics 2021-02-09 Jiefeng Liu , Yunhe Sheng , Chengming Bai

We propose a graph-based extension of Boolean logic called Boolean Graph Logic (BGL). Construing formula trees as the cotrees of cographs, we may state semantic notions such as evaluation and entailment in purely graph-theoretic terms,…

Logic in Computer Science · Computer Science 2020-04-28 Cameron Calk , Anupam Das , Tim Waring
‹ Prev 1 3 4 5 6 7 10 Next ›