English
Related papers

Related papers: Paraconsistent G\"{o}del modal logic on bi-relatio…

200 papers

We say that a Kripke model is a GL-model if the accessibility relation $\prec$ is transitive and converse well-founded. We say that a Kripke model is a D-model if it is obtained by attaching infinitely many worlds $t_1, t_2, \ldots$, and…

Logic · Mathematics 2025-08-13 Ryo Kashima , Taishi Kurahashi , Sohei Iwata , So Morioka

This work is divided between two main areas: in the theory of multialgebras, we focus mostly on a new definition of what a freely generated object should be in their category, and on how this category is equivalent to another with partially…

Logic · Mathematics 2022-06-23 Guilherme Vicentin de Toledo

In this paper we express certain multiplicities in modular representation-theoretic categories of type A in terms of affine p-Kazhdan-Lusztig polynomials. The representation-theoretic categories we deal with include the categories of…

Representation Theory · Mathematics 2017-01-04 Ben Elias , Ivan Losev

Let ML(U^+) denote the fragment of modal logic extended with the universal modality in which the universal modality occurs only positively. We characterize the relative definability of ML(U^+) relative to finite transitive frames in the…

Logic · Mathematics 2018-02-23 Katsuhiko Sano , Jonni Virtema

We consider the conjugation-action of an arbitrary upper-block parabolic subgroup of ${\rm GL}_n(\mathbf{C})$ on the variety of $x$-nilpotent complex matrices and translate it to a representation-theoretic context. We obtain a criterion as…

Representation Theory · Mathematics 2015-04-22 Magdalena Boos

We prove, for stably computably enumerable formal systems, direct analogues of the first and second incompleteness theorems of G\"odel. A typical stably computably enumerable set is the set of Diophantine equations with no integer…

Logic · Mathematics 2024-12-19 Yasha Savelyev

In an earlier paper, "Omega-inconsistency in Goedel's formal system: a constructive proof of the Entscheidungsproblem" (math/0206302), I argued that a constructive interpretation of Goedel's reasoning establishes any formal system of…

General Mathematics · Mathematics 2007-05-23 Bhupinder Singh Anand

We study abstract versions of G\"odel's second incompleteness theorem and formulate generalizations of L\"ob's derivability conditions that work for logics weaker than the classical one. We isolate the role of contraction rule in G\"odel's…

Logic · Mathematics 2016-02-19 Lev Beklemishev , Daniyar Shamkanov

Relational semantics for linear logic is a form of non-idempotent intersection type system, from which several informations on the execution of a proof-structure can be recovered. An element of the relational interpretation of a…

Logic in Computer Science · Computer Science 2016-06-02 Giulio Guerrieri , Luc Pellissier , Lorenzo Tortora de Falco

We introduce our implementation in HOL Light of the metatheory for G\"odel-L\"ob provability logic (GL), covering soundness and completeness w.r.t. possible world semantics and featuring a prototype of a theorem prover for GL itself. The…

Logic in Computer Science · Computer Science 2023-10-13 Marco Maggesi , Cosimo Perini Brogi

Non-wellfounded proof theory results from allowing proofs of infinite height in proof theory. To guarantee that there is no vicious infinite reasoning, it is usual to add a constraint to the possible infinite paths appearing in a proof.…

Logic · Mathematics 2025-06-03 Borja Sierra Miranda , Thomas Studer , Lukas Zenger

We extend to natural deduction the approach of Linear Nested Sequents and of 2-sequents. Formulas are decorated with a spatial coordinate, which allows a formulation of formal systems in the original spirit of natural deduction -- only one…

Logic in Computer Science · Computer Science 2021-04-27 Simone Martini , Andrea Masini , Margherita Zorzi

A many-valued modal logic is introduced that combines the usual Kripke frame semantics of the modal logic K with connectives interpreted locally at worlds by lattice and group operations over the real numbers. A labelled tableau system is…

Logic in Computer Science · Computer Science 2023-06-22 Denisa Diaconescu , George Metcalfe , Laura Schnüriger

It is argued that 4-valued paraconsistent truth values (called here "p-bits") can serve as a conceptual, mathematical and practical foundation for highly AI-relevant forms of probabilistic logic and probabilistic programming and concept…

Artificial Intelligence · Computer Science 2021-01-15 Ben Goertzel

We propose a new version of generalized probabilistic propositional logic, namely, discrete-continuous logic (DCL) in which every generalized proposition (GP) is represented as 2x2 nondiagonal positive matrix with unit trace. We demonstrate…

Physics and Society · Physics 2013-06-12 E. D. Vol

In Outline of a Theory of Truth, Kripke introduces some of the central concepts of the logical study of truth and paradox. He informally defines some of these -- such as groundedness and paradoxicality -- using modal locutions. We introduce…

Logic · Mathematics 2025-03-27 James Walsh

Given a class $\mathcal C$ of models, a binary relation ${\mathcal R}$ between models, and a model-theoretic language $L$, we consider the modal logic and the modal algebra of the theory of $\mathcal C$ in $L$ where the modal operator is…

Logic · Mathematics 2019-10-22 Denis I. Saveliev , Ilya B. Shapirovsky

The paper is devoted to modal properties of the ternary strict betweenness relation as used in the development of various systems of geometry. We show that such a relation is non-definable in a basic similarity type with a binary operator…

Logic · Mathematics 2024-10-29 Rafał Gruszczyński , Zhiguang Zhao

In a joint work with N. Mok in 1997, we proved that for an irreducible representation $G \subset {\bf GL}(V),$ if a holomorphic $G$-structure exists on a uniruled projective manifold, then the Lie algebra of $G$ has nonzero prolongation. We…

Algebraic Geometry · Mathematics 2017-12-12 Jun-Muk Hwang

We consider logic-based argumentation in which an argument is a pair (Fi,al), where the support Fi is a minimal consistent set of formulae taken from a given knowledge base (usually denoted by De) that entails the claim al (a formula). We…

Computational Complexity · Computer Science 2014-02-28 Nadia Creignou , Uwe Egly , Johannes Schmidt