English
Related papers

Related papers: Suszko's Thesis and Many-valued Logical Structures

200 papers

Propositional logics in general, considered as a set of sentences, can be undecidable even if they have "nice" representations, e.g., are given by a calculus. Even decidable propositional logics can be computationally complex (e.g., already…

Logic · Mathematics 2019-08-06 Matthias Baaz , Richard Zach

We introduce a complete many-valued semantics for two normal lattice-based modal logics. This semantics is based on reflexive many-valued graphs. We discuss an interpretation and possible applications of this logical framework in the…

Bi-intuitionistic logic is the conservative extension of intuitionistic logic with a connective dual to implication. It is sometimes presented as a symmetric constructive subsystem of classical logic. In this paper, we compare three sequent…

Logic in Computer Science · Computer Science 2011-01-31 Luís Pinto , Tarmo Uustalu

In this book, we consider various many-valued logics: standard, linear, hyperbolic, parabolic, non-Archimedean, p-adic, interval, neutrosophic, etc. We survey also results which show the tree different proof-theoretic frameworks for…

Logic in Computer Science · Computer Science 2007-07-24 Andrew Schumann , Florentin Smarandache

This paper is an original attempt to understand the foundations of economic reasoning. It endeavors to rigorously define the relationship between subjective interpretations and objective valuations of such interpretations in the context of…

Logic in Computer Science · Computer Science 2024-05-20 Daniel Lu

Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…

Logic in Computer Science · Computer Science 2025-05-01 Nikolaos Galatos , Vitor Greati , Revantha Ramanayake , Gavin St. John

In this paper we propose a general approach to define a many-valued preferential interpretation of gradual argumentation semantics. The approach allows for conditional reasoning over arguments and boolean combination of arguments, with…

Artificial Intelligence · Computer Science 2025-06-10 Mario Alviano , Laura Giordano , Daniele Theseider Dupré

I deal with two approaches to proof-theoretic semantics: one based on argument structures and justifications, which I call reducibility semantics, and one based on consequence among (sets of) formulas over atomic bases, called base…

Logic · Mathematics 2025-11-11 Antonio Piccolomini d'Aragona

This paper studies which truth-values are most likely to be taken on finite models by arbitrary sentences of a many-valued predicate logic. We obtain generalizations of Fagin's classical zero-one law for any logic with values in a finite…

Logic · Mathematics 2026-02-11 Guillermo Badia , Xavier Caicedo , Carles Noguera

The field of proof-theoretic semantics (P-tS) offers an alternative approach to meaning in logic that is based on inference and argument (rather than truth in a model). It has been successfully developed for various logics; in particular,…

Logic · Mathematics 2025-03-10 Alexander V. Gheorghiu , Yll Buzoku

This paper is a contribution to graded model theory, in the context of mathematical fuzzy logic. We study characterizations of classes of graded structures in terms of the syntactic form of their first-order axiomatization. We focus on…

Logic · Mathematics 2019-01-08 Guillermo Badia , Vicent Costa , Pilar Dellunde , Carles Noguera

A semantics is given to possibilistic logic, a logic that handles weighted classical logic formulae, and where weights are interpreted as lower bounds on degrees of certainty or possibility, in the sense of Zadeh's possibility theory. The…

Artificial Intelligence · Computer Science 2013-03-26 Jerome Lang , Didier Dubois , Henri Prade

Rhetorical Structure Theory implies no single discourse interpretation of a text, and the limitations of RST parsers further exacerbate inconsistent parsing of similar structures. Therefore, it is important to take into account that the…

Computation and Language · Computer Science 2024-01-23 Elena Chistova

We define a new logic-induced notion of bisimulation (called $\rho$-bisimulation) for coalgebraic modal logics given by a logical connection, and investigate its properties. We show that it is structural in the sense that it is defined only…

Logic in Computer Science · Computer Science 2020-08-24 Jim de Groot , Helle Hvid Hansen , Alexander Kurz

We study many-valued coalgebraic logics with semi-primal algebras of truth-degrees. We provide a systematic way to lift endofunctors defined on the variety of Boolean algebras to endofunctors on the variety generated by a semi-primal…

Logic in Computer Science · Computer Science 2024-08-07 Alexander Kurz , Wolfgang Poiger , Bruno Teheux

Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature. We describe an intuitionistic substructural logic called…

Logic in Computer Science · Computer Science 2023-06-22 Simon Docherty , David Pym

Intuitionistic grammar logics fuse constructive and multi-modal reasoning while permitting the use of converse modalities, serving as a generalization of standard intuitionistic modal logics. In this paper, we provide definitions of these…

Logic in Computer Science · Computer Science 2025-12-04 Tim S. Lyon

The paper is dedicated to the problem of adding a modality to the \Lukasiewicz many-valued logics in the purpose of obtaining completeness results for Kripke semantics. We define a class of modal many-valued logics and their corresponding…

Logic · Mathematics 2007-05-23 Georges Hansoul , Bruno Teheux

Every countable structure has a sentence of the infinitary logic $\mathcal{L}_{\omega_1 \omega}$ which characterizes that structure up to isomorphism among countable structures. Such a sentence is called a Scott sentence, and can be thought…

Logic · Mathematics 2020-11-10 Matthew Harrison-Trainor

This work is the first exploration of proof-theoretic semantics for a substructural logic. It focuses on the base-extension semantics (B-eS) for intuitionistic multiplicative linear logic (IMLL). The starting point is a review of…

Logic in Computer Science · Computer Science 2024-11-13 Alexander V. Gheorghiu , Tao Gu , David J. Pym