English
Related papers

Related papers: Intermediate logics in the setting of team semanti…

200 papers

In this paper we investigate the fragment of intuitionistic logic which only uses conjunction (meet) and implication, using finite duality for distributive lattices and universal models. We give a description of the finitely generated…

Logic · Mathematics 2015-05-15 Nick Bezhanishvili , Dion Coumans , Samuel J. van Gool , Dick de Jongh

We analyze the problem of defining well-founded semantics for ordered logic programs within a general framework based on alternating fixpoint theory. We start by showing that generalizations of existing answer set approaches to preference…

Artificial Intelligence · Computer Science 2007-05-23 Torsten Schaub , Kewen Wang

We consider intuitionistic variants of linear temporal logic with `next', `until' and `release' based on expanding posets: partial orders equipped with an order-preserving transition function. This class of structures gives rise to a logic…

Logic in Computer Science · Computer Science 2020-01-01 Philippe Balbiani , Joseph Boudou , Martín Diéguez , David Fernández-Duque

We present an elementary introduction to a new logic for reasoning about behaviors that occur over time. This logic is based on temporal type theory. The syntax of the logic is similar to the usual first-order logic; what differs is the…

Logic · Mathematics 2022-11-04 Brendan Fong , Alberto Speranzon , David I. Spivak

In this paper, we present the interval neutrosophic logics which generalizes the fuzzy logic, paraconsistent logic, intuitionistic fuzzy logic and many other non-classical and non-standard logics. We will give the formal definition of…

Logic in Computer Science · Computer Science 2007-05-23 Haibin Wang , Florentin Smarandache , Yanqing Zhang , Rajshekhar Sunderraman

In this paper some reflections on the concept of transition are presented: groupoids are introduced as models for the construction of a ``generalized logic'' whose basic statements involve pairs of propositions which can be conditioned. In…

Mathematical Physics · Physics 2023-08-02 Florio M. Ciaglia aand Fabio Di Cosmo

This article aims to provide a unified and technical approach to semantic information, communication, and their interplay through the lens of probabilistic logic. To this end, on top of the existing technical communication (TC) layer, we…

Information Theory · Computer Science 2022-01-19 Jinho Choi , Seng W. Loke , Jihong Park

We consider modeling the conception of knowledge in terms of temporal logic. The study of knowledge logical operations is originated around 1962 by representation of knowledge and belief using modalities. Nowadays, it is very good…

Logic in Computer Science · Computer Science 2014-05-06 Vladimir Rybakov

Intuitionistic logic extended with decidable propositional atoms combines classical properties in its propositional part and intuitionistic properties for derivable formulas not containing propositional symbols. Sequent calculus is used as…

General Mathematics · Mathematics 2007-05-23 Alexander Sakharov

We introduce stratified labelings as a novel semantical approach to abstract argumentation frameworks. Compared to standard labelings, stratified labelings provide a more fine-grained assessment of the controversiality of arguments using…

Artificial Intelligence · Computer Science 2013-08-06 Matthias Thimm , Gabriele Kern-Isberner

We present a polymorphic linear lambda-calculus as a proof language for second-order intuitionistic linear logic. The calculus includes addition and scalar multiplication, enabling the proof of a linearity result at the syntactic level.

Logic in Computer Science · Computer Science 2024-06-19 Alejandro Díaz-Caro , Gilles Dowek , Malena Ivnisky , Octavio Malherbe

Topological fixpoint logics are a family of logics that admits topological models and where the fixpoint operators are defined with respect to the topological interpretations. Here we consider a topological fixpoint logic for relational…

Logic in Computer Science · Computer Science 2016-09-15 Nick Bezhanishvili , Clemens Kupke

We obtain, for the first time, a modular many-valued semantics for combined logics, which is built directly from many-valued semantics for the logics being combined, by means of suitable universal operations over partial non-deterministic…

Logic · Mathematics 2024-05-22 Carlos Caleiro , Sérgio Marcelino

We characterize the languages in the individual levels of the quantifier alternation hierarchy of first-order logic with two variables by identities. This implies decidability of the individual levels. More generally we show that the…

Logic in Computer Science · Computer Science 2012-05-23 Andreas Krebs , Howard Straubing

Our understanding about things is conceptual. By stating that we reason about objects, it is in fact not the objects but concepts referring to them that we manipulate. Now, so long just as we acknowledge infinitely extending notions such as…

Artificial Intelligence · Computer Science 2015-04-21 Ryuta Arisaka

Inquisitive modal logic InqML is a generalisation of standard Kripke-style modal logic. In its epistemic incarnation, it extends standard epistemic logic to capture not just the information that agents have, but also the questions that they…

Logic · Mathematics 2023-06-22 Ivano Ciardelli , Martin Otto

This paper establishes and proves representation theorems for cumulative propositional dependence logic and for cumulative propositional logic with team semantics. Cumulative logics are famously given by System C. For propositional…

Logic in Computer Science · Computer Science 2026-02-26 Juha Kontinen , Arne Meier , Kai Sauerwald

We present three different functional interpretations of intuitionistic linear logic ILL and show how these correspond to well-known functional interpretations of intuitionistic logic IL via embeddings of IL into ILL. The main difference…

Logic in Computer Science · Computer Science 2015-07-01 Gilda Ferreira , Paulo Oliva

In this paper we investigate the notion of legibility in sequential decision-making in the context of teams and teamwork. There have been works that extend the notion of legibility to sequential decision making, for deterministic and for…

Artificial Intelligence · Computer Science 2025-07-30 Miguel Faria , Francisco S. Melo , Ana Paiva

At the heart of intuitionistic type theory lies an intuitive semantics called the "meaning explanations"; crucially, when meaning explanations are taken as definitive for type theory, the core notion is no longer "proof" but "verification".…

Logic in Computer Science · Computer Science 2016-07-18 Jonathan Sterling
‹ Prev 1 8 9 10 Next ›