Related papers: Non-contingecy in a paraconsistent setting

It is known that first-order logic with some counting extensions can be efficiently evaluated on graph classes with bounded expansion, where depth-$r$ minors have constant density. More precisely, the formulas are $\exists x_1 ... x_k \#y…

Information flow security properties were defined some years ago (see, e.g., the surveys \cite{FG01,Ry01}) in terms of suitable equivalence checking problems. These definitions were provided by using sequential models of computations (e.g.,…

Deep stochastic state-space models enable Bayesian filtering in nonlinear, partially observed systems but typically assume a fixed latent structure. When this assumption is violated, parameter adaptation alone may result in persistent…

In this work, we have presented a simple analytical approximation scheme for generic non-linear FBSDEs. By treating the interested system as the linear decoupled FBSDE perturbed with non-linear generator and feedback terms, we have shown…

We present a logical system CFP (Concurrent Fixed Point Logic) supporting the extraction of nondeterministic and concurrent programs that are provably total and correct. CFP is an intuitionistic first-order logic with inductive and…

A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have…

Bilattices provide an algebraic tool with which to model simultaneously knowledge and truth. They were introduced by Belnap in 1977 in a paper entitled \emph{How a computer should think}. Belnap argued that instead of using a logic with two…

We present a construction of nondeterministic semantics for some deontic logics based on the class of paraconsistent logics known as Logics of Formal Inconsistency (LFIs), for the first time combining swap structures and Kripke models…

We provide a sound and complete proof system for an extension of Kleene's ternary logic to predicates. The concept of theory is extended with, for each function symbol, a formula that specifies when the function is defined. The notion of…

We present a novel investigation into the consistency operator ($\circ$), traditionally associated with paraconsistent logics, as a means of capturing non-normal modal classicalities within the Kripke framework. By semantically…

For a given number field $K$, we give a $\forall\exists\forall$-first order description of affine Darmon points over $\mathbb{P}^1_K$, and show that this can be improved to a $\forall\exists$-definition in a remarkable particular case.…

This paper is an extended version of an earlier submission to WoLLIC 2023. We discuss two-layered logics formalising reasoning with probabilities and belief functions that combine the Lukasiewicz $[0,1]$-valued logic with Baaz $\triangle$…

In this paper, we show that a partitioned formula \phi is dependent if and only if \phi has uniform definability of types over finite partial order indiscernibles. This generalizes our result from a previous paper [1]. We show this by…

We consider a temporal logic EF+F^-1 for unranked, unordered finite trees. The logic has two operators: EF\phi, which says "in some proper descendant \phi holds", and F^-1\phi, which says "in some proper ancestor \phi holds". We present an…

We present $\phi-$DeepONet, a physics-informed neural operator designed to learn mappings between function spaces that may contain discontinuities or exhibit non-smooth behavior. Classical neural operators are based on the universal…

A qualitative representation $\phi$ is like an ordinary representation of a relation algebra, but instead of requiring $(a; b)^\phi = a^\phi | b^\phi$, as we do for ordinary representations, we only require that $c^\phi\supseteq a^\phi |…

Irreversibility theorems -- such as the $A$-theorem -- establish a hierarchy among fixed points of the renormalization group flow. The strongest thesis of this type of theorems would be that there exists a scalar function $A$ (generally…

Building on the locality conditions for first-order logic by Hanf and Gaifman, Barthelmann and Schwentick showed in 1999 that every first-order formula is equivalent to a formula of the shape $\exists x_1 \dotsc \exists x_k \forall y\,\phi$…

Classical logic predicts that everything (thus nothing useful at all) follows from inconsistency. A paraconsistent logic is a logic where an inconsistency does not lead to such an explosion, and since in practice consistency is difficult to…

In automated complexity analysis, noninterference-based type systems statically guarantee, via soundness, the property that well-typed programs compute functions of a given complexity class, e.g., the class FP of functions computable in…