English
Related papers

Related papers: Standard Logics Are Valuation-Nonmonotonic

200 papers

Recently, a novel fixed point operation has been introduced over certain non-monotonic functions between stratified complete lattices and used to give semantics to logic programs with negation and boolean context-free grammars. We prove…

Logic in Computer Science · Computer Science 2015-12-11 Zoltan Esik

Based on the ideas of quantum theory of open systems (QTOS) we propose the consistent approach to study probabilistic many-valued propositional logic of intelligent devices that are composed from separate but interconnected logical units.…

Quantum Physics · Physics 2013-01-24 E. D. Vol

We introduce the operation of possibility qualification and show how. this modal-like operator can be used to represent "typical" or default knowledge in a theory of nonmonotonic reasoning. We investigate the representational power of this…

Artificial Intelligence · Computer Science 2013-04-10 Ronald R. Yager

It is widely accepted that the logic of quantum mechanics is based on orthomodular posets. However, such a logic is not dynamic in the sense that it does not incorporate time dimension. To fill this gap, we introduce certain tense operators…

Logic · Mathematics 2023-04-19 Ivan Chajda , Helmut Länger

Timothy Williamson has recently argued that the applicability of classical mathematics in the natural and social sciences raises a problem for the endorsement, in non-mathematical domains, of a wide range of non-classical logics. We first…

History and Philosophy of Physics · Physics 2024-01-25 Sebastian Horvat , Iulian D. Toader

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

Contextuality is widely regarded as a hallmark of quantum information, yet its structural origin is often obscured by probabilistic or operational formulations. In this work, we show that non-distributive orthomodular structure need not be…

Quantum Physics · Physics 2026-03-25 Yukio-Pegio Gunji , Yoshihiko Ohzawa , Yuki Tokuyama , Yu Huang , Kyoko Nakamura

Logical reasoning is central to complex human activities, such as thinking, debating, and planning; it is also a central component of many AI systems as well. In this paper, we investigate the extent to which encoder-only transformer…

Computation and Language · Computer Science 2024-07-02 Paulo Pirozelli , Marcos M. José , Paulo de Tarso P. Filho , Anarosa A. F. Brandão , Fabio G. Cozman

Relation-changing modal logics are extensions of the basic modal logic that allow changes to the accessibility relation of a model during the evaluation of a formula. In particular, they are equipped with dynamic modalities that are able to…

Logic in Computer Science · Computer Science 2016-09-15 Carlos Areces , Raul Fervari , Guillaume Hoffmann , Mauricio Martel

This paper introduces the logic $QLET_{F}$, a quantified extension of the logic of evidence and truth $LET_{F}$, together with a corresponding sound and complete first-order non-deterministic valuation semantics. $LET_{F}$ is a…

Logic · Mathematics 2021-06-21 H. Antunes , A. Rodrigues , W. Carnielli , M. E. Coniglio

Canonical models are of central importance in modal logic, in particular as they witness strong completeness and hence compactness. While the canonical model construction is well understood for Kripke semantics, non-normal modal logics…

Logic in Computer Science · Computer Science 2009-02-13 Lutz Schröder , Dirk Pattinson

We extend classical work by Janusz Czelakowski on the closure properties of the class of matrix models of entailment relations - nowadays more commonly called multiple-conclusion logics - to the setting of non-deterministic matrices…

Logic · Mathematics 2023-10-05 Carlos Caleiro , Sérgio Marcelino , Umberto Rivieccio

Non-classical negations may fail to be contradictory-forming operators in more than one way, and they often fail also to respect fundamental meta-logical properties such as the replacement property. Such drawbacks are witnessed by intricate…

Logic in Computer Science · Computer Science 2017-07-26 Ori Lahav , João Marcos , Yoni Zohar

Boolean grammars generalize context-free rewriting by extending the possibilities when dealing with different rules for the same nonterminal symbol. By allowing not only disjunction (as in the case of usual context-free grammars), but also…

Formal Languages and Automata Theory · Computer Science 2024-09-12 Patrik Adrián , György Vaszil

The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions. This means that, as far as the differential lambda-calculus and differential…

Logic in Computer Science · Computer Science 2024-02-14 Thomas Ehrhard

In this paper we make a contribution to the unification of formal models of defeasible reasoning. We present several translations between formal argumentation frameworks and nonmonotonic logics for reasoning with plausible assumptions. More…

Artificial Intelligence · Computer Science 2016-04-04 Jesse Heyninck , Christian Straßer

Up to equivalence, a substitution in propositional logic is an endomorphism of its free algebra. On the dual space, this results in a continuous function, and whenever the space carries a natural measure one may ask about the stochastic…

Logic · Mathematics 2007-05-23 Giovanni Panti

Doubts are raised concerning the usual interpretation of the alleged failure, by quantum mechanics, of the distributive law of classical logic. The difficulty raised by incompatible sets of observables is overcome within an epistemic…

Quantum Physics · Physics 2015-04-27 Alfredo B. Henriques , Amílcar Sernadas

In recent research, some of the present authors introduced the concept of an n-dimensional Boolean algebra and its corresponding propositional logic nCL, generalising the Boolean propositional calculus to n>= 2 perfectly symmetric truth…

Logic in Computer Science · Computer Science 2024-05-08 Antonio Bucciarelli , Pierre-Louis Curien , Antonio Ledda , Francesco Paoli , Antonino Salibra

We introduce a new variant of dependence logic called Boolean dependence logic. In Boolean dependence logic dependence atoms are of the type =(x_1,...,x_n,\alpha), where \alpha is a Boolean variable. Intuitively, with Boolean dependence…

Logic · Mathematics 2014-06-30 Johannes Ebbing , Lauri Hella , Peter Lohmann , Jonni Virtema