English
Related papers

Related papers: Unary interpretability logics for sublogics of the…

200 papers

We introduce a logical framework for reasoning about "uncertain interpretations" and investigate two key applications: a new semantics for implication capturing a kind of "meaning entailment", and a conservative notion of "evidentially…

Logic in Computer Science · Computer Science 2025-03-21 Adam Bjorndahl

In this paper, we define a multi-type calculus for inquisitive logic, which is sound, complete and enjoys Belnap-style cut-elimination and subformula property. Inquisitive logic is the logic of inquisitive semantics, a semantic framework…

Logic in Computer Science · Computer Science 2016-04-05 Sabine Frittella , Giuseppe Greco , Alessandra Palmigiano , Fan Yang

Given a subshift over an arbitrary alphabet, we construct a representation of the associated unital algebra. We describe a criteria for the faithfulness of this representation in terms of the existence of cycles with no exits. Subsequently,…

Rings and Algebras · Mathematics 2023-06-29 Daniel Gonçalves , Danilo Royer

We give three elementary proofs of a nice equality of definite integrals, which arises from the theory of bivariate hypergeometric functions, and has connections with irrationality proofs in number theory. We furthermore provide a…

Classical Analysis and ODEs · Mathematics 2020-02-26 Alin Bostan , Fernando Chamizo , Mikael P. Sundqvist

Uniform Lie algebras are combinatorially defined two-step nilpotent Lie algebras which can be used to define Einstein solvmanifolds. These Einstein spaces often have nontrivial isotropy groups. We derive basic properties of uniform Lie…

Differential Geometry · Mathematics 2016-03-03 Tracy L. Payne , Matthew Schroeder

We consider a family U of finite universes. The second order quantifier Q_R, means for each u in U quantifying over a set of n(R)-place relations isomorphic to a given relation. We define a natural partial order on such quantifiers called…

Logic · Mathematics 2007-05-23 Mor Doron , Saharon Shelah

The Description Logic EL has recently drawn considerable attention since, on the one hand, important inference problems such as the subsumption problem are polynomial. On the other hand, EL is used to define large biomedical ontologies.…

Artificial Intelligence · Computer Science 2015-07-01 Franz Baader , Barbara Morawska

We extend description logics (DLs) with non-monotonic reasoning features. We start by investigating a notion of defeasible subsumption in the spirit of defeasible conditionals as studied by Kraus, Lehmann and Magidor in the propositional…

Artificial Intelligence · Computer Science 2019-04-17 Katarina Britz , Giovanni Casini , Thomas Meyer , Kody Moodley , Uli Sattler , Ivan Varzinczak

We present a reading of the traditional syllogistics in a fragment of the propositional intuitionistic multiplicative linear logic and prove that with respect to a diagrammatic logical calculus that we introduced in a previous paper, a…

Logic in Computer Science · Computer Science 2013-03-01 Ruggero Pagnan

In this article we determine the implicational fragments of most of the known subintuitionistic logics.

Logic · Mathematics 2025-07-15 Fatemeh Shirmohammadzadeh Maleki , Dick de Jongh

A flexible infrastructure for normative reasoning is outlined. A small-scale demonstrator version of the envisioned system has been implemented in the proof assistant Isabelle/HOL by utilising the first authors universal logical reasoning…

Artificial Intelligence · Computer Science 2018-04-10 Christoph Benzmüller , Xavier Parent

We study the expressive power of fragments of inclusion and independence logic defined either by restricting the number of universal quantifiers or the arity of inclusion and independence atoms in formulas. Assuming the so-called lax…

Logic · Mathematics 2013-04-17 Pietro Galliani , Miika Hannula , Juha Kontinen

We apply to logic programming some recently emerging ideas from the field of reduction-based communicating systems, with the aim of giving evidence of the hidden interactions and the coordination mechanisms that rule the operational…

Logic in Computer Science · Computer Science 2007-05-23 Roberto Bruni , Ugo Montanari , Francesca Rossi

An inductive logic can be formulated in which the elements are not propositions or probability distributions, but information systems. The logic is complete for information systems with binary hypotheses, i.e., it applies to all such…

Artificial Intelligence · Computer Science 2013-04-11 Norman C. Dalkey

Indexed Linear Logic has been introduced by Ehrhard and Bucciarelli, it can be seen as a logical presentation of non-idempotent intersection types extended through the relational semantics to the full linear logic. We introduce an…

Logic in Computer Science · Computer Science 2024-02-16 Flavien Breuvart , Federico Olimpieri

The logic of bunched implications (BI), introduced by O'Hearn and Pym (1999), has attracted significant attention due to its elegant proof calculus, varied semantics, and close connections to the propositional fragment of separation logic.…

A logic has uniform interpolation if its formulas can be projected down to given subsignatures, preserving all logical consequences that do not mention the removed symbols; the weaker property of (Craig) interpolation allows the projected…

Logic in Computer Science · Computer Science 2022-05-03 Fatemeh Seifan , Lutz Schröder , Dirk Pattinson

In this paper we introduce the variety of I-modal ririgs. We characterize the congruence lattice of its members by means of I-filters and we provide a description on I-filter generation. We also provide an axiomatic presentation for the…

Logic · Mathematics 2022-08-10 Agustín L. Nagy , William J. Zuluaga Botero

We identify multirole logic as a new form of logic in which conjunction/disjunction is interpreted as an ultrafilter on the power set of some underlying set (of roles) and the notion of negation is generalized to endomorphisms on this…

Logic · Mathematics 2017-03-21 Hongwei Xi , Hanwen Wu

In a previous paper, a tableau calculus has been presented, which constitute a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work extends such a calculus to multi-modal…

Logic in Computer Science · Computer Science 2013-12-11 M. Cialdea Mayer
‹ Prev 1 3 4 5 6 7 10 Next ›