Related papers: Weakly complete axiomatization of exogenous quantu…
We present a first-order probabilistic epistemic logic, which allows combining operators of knowledge and probability within a group of possibly infinitely many agents. The proposed framework is the first order extension of the logic of…
We present a new proof for the equivalence of potential theoretic weak solutions and viscosity solutions to the $\texttt{p}(\cdot)$-Laplace equation in $\mathbb{R}^n$. The proof of the equivalence in the variable exponent case in Euclidean…
We investigate the complexity of satisfiability for finite-variable fragments of propositional dynamic logics. We consider three formalisms belonging to three representative complexity classes, broadly understood,---regular PDL, which is…
We propose a conjugate logic that can capture the behavior of quantum and quantum-like systems. The proposal is similar to the more generic concept of epistemic logic: it encodes knowledge or perhaps more correctly, predictions about…
For performance and verification in machine learning, new methods have recently been proposed that optimise learning systems to satisfy formally expressed logical properties. Among these methods, differentiable logics (DLs) are used to…
The word \textit{proposition} is used in physics with different meanings, which must be distinguished to avoid interpretational problems. We construct two languages $\mathcal{L}^{\ast}(x)$ and $\mathcal{L}(x)$ with classical set-theoretical…
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…
In this paper, we consider iterative propositional calculi, which are finite sets of propositional formulas together with the rules of modus ponens and weak substitution (when formula being substituted must be already inferred). We…
A finitary propositional logic can be given an algebraic reading in two different ways: by translating formulas into equations and logical rules into quasi-equations, or by translating logical rules directly into equations. The former type…
In this paper we present a transformation of finite propositional default theories into so-called propositional argumentation systems. This transformation allows to characterize all notions of Reiter's default logic in the framework of…
The goal of this article is to clarify some misunderstandings and inappropriate claims made in [6] regarding the relation between the weak Galerkin (WG) finite element method and the hybridizable discontinuous Galerkin (HDG). In this paper,…
Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show that two constants (falsity and implication) suffice for…
We extend the framework of abstract algebraic logic to weak logics, namely logical systems which are not necessarily closed under uniform substitution. We interpret weak logics by algebras expanded with an additional predicate and we…
The logic LAE discussed in this paper is based on an approximate entailment relation. LAE generalises classical propositional logic to the effect that conclusions can be drawn with a quantified imprecision. To this end, properties are…
We study abstract intermediate justification logics, that is arbitrary intermediate propositional logics extended with a subset of specific axioms of (classical) justification logics. For these, we introduce various semantics by combining…
We introduce the notion of a homological integral for an infinite-dimensional weak Hopf algebra and use the homological integral to prove several structure theorems. For example, we prove that the Artin--Schelter property and the Van den…
By careful analysis of the comparison map from a simplicial set to its image under Kan's ex-infinity functor we obtain a new and combinatorial proof that it is a weak homotopy equivalence. Moreover, we obtain a presentation of it as a…
We present a completeness result for the implicit fragment of justification stit logic. Although this fragment allows for no strongly complete axiomatization, we show that a restricted form of strong completeness (subsuming weak…
Recently, several authors studied small quantum systems weakly coupled to free boson or fermion fields at positive temperature. All the approaches we are aware of employ complex deformations of Liouvillians or Mourre theory (the…
This paper introduces the application of the weak Galerkin (WG) finite element method to solve the Steklov eigenvalue problem, focusing on obtaining lower bounds of the eigenvalues. The noncomforming finite element space of the weak…