English
Related papers

Related papers: Ludique : une logique sans axiome d'identit\'e

200 papers

Sambin et al. (2000) introduced Basic Logic as a uniform framework for various logics. At the same time, they also introduced the principle of reflection as a criterion for being a connective in Basic Logic. In this paper, we make explicit…

Logic · Mathematics 2026-01-29 Yuki Nishimuta

Predicate Logic with Definitions (PLD or D-logic) is a modification of first-order logic intended mostly for practical formalization of mathematics. The main syntactic constructs of D-logic are terms, formulas and definitions. A definition…

Logic in Computer Science · Computer Science 2007-05-23 Victor Makarov

The unique capabilities of Large Language Models (LLMs), such as the natural language text generation ability, position them as strong candidates for providing explanation for recommendations. However, despite the size of the LLM, most…

Artificial Intelligence · Computer Science 2024-01-19 Behnam Rahdari , Hao Ding , Ziwei Fan , Yifei Ma , Zhuotong Chen , Anoop Deoras , Branislav Kveton

Much of philosophical logic and all of philosophy of language make empirical claims about the vernacular natural language. They presume semantics under which `and' and `or' are related by the dually paired distributive and absorption laws.…

Computation and Language · Computer Science 2014-03-19 Arthur Merin

Ludics is peculiar in the panorama of game semantics: we first have the definition of interaction-composition and then we have semantical types, as a set of strategies which "behave well" and react in the same way to a set of tests. The…

Logic in Computer Science · Computer Science 2015-07-01 Claudia Faggian , Michele Basaldella

Indexed languages are a generalization of context-free languages and form a proper subset of context-sensitive languages. We propose to generalize to indexed languages several well known characterizations of context-free languages: namely,…

Formal Languages and Automata Theory · Computer Science 2015-11-11 Severine Fratani , El Makki Voundy

We address the relative expressiveness of defeasible logics in the framework DL. Relative expressiveness is formulated as the ability to simulate the reasoning of one logic within another logic. We show that such simulations must be…

Artificial Intelligence · Computer Science 2021-02-16 Michael Maher

Goedel's completeness theorem is concerned with provability, while Girard's theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proofs. Our purpose is to look for a connection between these two…

Logic in Computer Science · Computer Science 2015-07-01 Michele Basaldella , Kazushige Terui

A non-commutative, non-associative weakening of Girard's linear logic is developed for multiplicative and additive connectives. Additional assumptions capture the logic of quantic measurements.

Logic in Computer Science · Computer Science 2022-01-07 Daniel Lehmann

We introduce a new nameless representation of lambda terms inspired by ordered logic. At a lambda abstraction, number and relative position of all occurrences of the bound variable are stored, and application carries the additional…

Logic in Computer Science · Computer Science 2011-11-02 Andreas Abel , Nicolai Kraus

The generalisation of irony detection faces significant challenges, leading to substantial performance deviations when detection models are applied to diverse real-world scenarios. In this study, we find that irony-focused prompts, as…

Computation and Language · Computer Science 2025-06-12 Peiling Yi , Yuhan Xia , Yunfei Long

Type-free systems of logic are designed to consistently handle significant instances of self-reference. Some consistent type-free systems also have the feature of allowing the sort of general abstraction or comprehension principle that…

Logic · Mathematics 2007-05-23 Wayne Aitken , Jeffrey A. Barrett

This paper revisits the multi-agent epistemic logic presented in [10], where agents and sets of agents are replaced by abstract, intensional "names". We make three contributions. First, we study its model theory, providing adequate notions…

Logic in Computer Science · Computer Science 2021-06-23 Marta Bílková , Zoé Christoff , Olivier Roy

This paper proposes an alternative to standard first-order logic that seeks greater naturalness, generality, and semantic self-containment. The system removes the first-order restriction, avoids type hierarchies, and dispenses with external…

Logic · Mathematics 2025-08-12 Mauro Avon

In this paper we will see deductive systems for classical propositional and predicate logic in the calculus of structures. Like sequent systems, they have a cut rule which is admissible. In addition, they enjoy a top-down symmetry and some…

Logic · Mathematics 2009-09-29 Kai Bruennler

Recently, the description logic LE-ALC was introduced for reasoning in the semantic environment of the enriched formal contexts, and a tableaux algorithm was developed for checking the consistency of ABoxes in this logic. In this paper, we…

Logic in Computer Science · Computer Science 2025-06-09 Krishna Manoorkar , Ruoding Wang

This paper investigates formal logics for reasoning about determinacy and independence. Propositional Dependence Logic D and Propositional Independence Logic I are recently developed logical systems, based on team semantics, that provide a…

Logic · Mathematics 2017-12-05 Valentin Goranko , Antti Kuusisto

In the philosophical tradition of `analytic pragmatism', which attempts to account for linguistic meanings in terms of their practices of use, logical expressivism is a theory which offers a distinct perspective on logic. We shed light on…

Category Theory · Mathematics 2026-05-26 Kristopher Brown

Correspondence theory allows us to create sound and complete axiomatizations for modal logic on frames with certain properties. For example, if we restrict ourselves to transitive frames we should add the axiom $\square \phi \rightarrow…

Logic in Computer Science · Computer Science 2023-07-12 Philippe Balbiani , Wiebe van der Hoek , Louwe B. Kuijer

Description Logics (DLs) are appropriate, widely used, logics for managing structured knowledge. They allow reasoning about individuals and concepts, i.e. set of individuals with common properties. Typically, DLs are limited to dealing with…

Artificial Intelligence · Computer Science 2016-11-17 Haibin Wang , Andre Rogatko , Florentin Smarandache , Rajshekhar Sunderraman