English
Related papers

Related papers: Affine logic with the integration operator

200 papers

This paper is devoted to systematic studies of some extensions of first-order G\"odel logic. The first extension is the first-order rational G\"odel logic which is an extension of first-order G\"odel logic, enriched by countably many…

Deep and shallow embeddings of non-classical logics in classical higher-order logic have been explored, implemented, and used in various reasoning tools in recent years. This paper presents a method for the simultaneous deployment of deep…

Logic in Computer Science · Computer Science 2025-06-03 Christoph Benzmüller

We apply the topology of convergence on compact sets to define unpredictable functions [5, 6]. The topology is metrizable and easy for applications with integral operators. To demonstrate the effectiveness of the approach, the existence and…

Chaotic Dynamics · Physics 2016-11-17 Marat Akhmet , Mehmet Onur Fen

In \cite{Craig}, we introduced a syntactically defined and highly general class of calculi known as \emph{semi-analytic}. We then demonstrated that any sufficiently strong (modal) substructural logic with a semi-analytic calculus must…

Logic in Computer Science · Computer Science 2025-06-27 Amirhossein Akbar Tabatabai , Raheleh Jalali

We develop the basic model theory of local positive logic, a new logic that mixes positive logic (where negation is not allowed) and local logic (where models omit types of infinite distant pairs). We study several basic model theoretic…

Logic · Mathematics 2025-10-01 Arturo Rodriguez Fanlo , Ori Segel

Refinement type checkers are a powerful way to reason about functional programs. For example, one can prove properties of a slow, specification implementation, porting the proofs to an optimized implementation that behaves the same. Without…

Programming Languages · Computer Science 2022-07-20 Niki Vazou , Michael Greenberg

We establish a categorical framework relating two canonical model constructions in first-order logic: the Henkin construction and compactness-based constructions via ultraproducts or saturation. By introducing a globally fixed set of Henkin…

General Mathematics · Mathematics 2025-10-23 Barreto Joaquim Reizi

One of the nice properties of the first-order logic is the compactness of satisfiability. It state that a finitely satisfiable theory is satisfiable. However, different degrees of satisfiability in many-valued logics, poses various kind of…

Logic · Mathematics 2022-06-02 Seyed Mohammad Amin Khatami

Adjoint logic is a general approach to combining multiple logics with different structural properties, including linear, affine, strict, and (ordinary) intuitionistic logics, where each proposition has an intrinsic mode of truth. It has…

Logic in Computer Science · Computer Science 2024-02-05 Junyoung Jang , Sophia Roshal , Frank Pfenning , Brigitte Pientka

The interaction of a Lie algebra $\LL,$ having a weight space decomposition with respect to a nonzero toral subalgebra, with its corresponding root system forms a powerful tool in the study of the structure of $\LL.$ This, in particular,…

Quantum Algebra · Mathematics 2018-07-13 Malihe Yousofzadeh

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…

Logic · Mathematics 2017-05-26 Grigory K. Olkhovikov

Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for LF in the style of recent formulations where only canonical…

Programming Languages · Computer Science 2015-07-01 William Lovas , Frank Pfenning

Abstract argumentation frameworks (AFs) are one of the most studied formalisms in AI. In this work, we introduce a certain subclass of AFs which we call compact. Given an extension-based semantics, the corresponding compact AFs are…

Artificial Intelligence · Computer Science 2014-05-01 Ringo Baumann , Wolfgang Dvorák , Thomas Linsbichler , Hannes Strass , Stefan Woltran

We focus on the persistence principle over weak interpretability logic. Our object of study is the logic obtained by adding the persistence principle to weak interpretability logic from several perspectives. Firstly, we prove that this…

Logic · Mathematics 2023-10-03 Sohei Iwata , Taishi Kurahashi , Yuya Okawa

We prove a compactness theorem in the context of Hennessy-Milner logic. It is used to derive a sufficient condition on modal characterizations for the Approximation Induction Principle to be sound modulo the corresponding process…

Logic in Computer Science · Computer Science 2009-11-12 Maciej Gazda , Wan Fokkink

We give an affine proof of Feuerbach's theorem, by constructing an explicit affine map which takes the nine-point circle of any given Euclidean triangle to the incircle and fixes the Feuerbach point. The proof is shown to be valid in any…

Metric Geometry · Mathematics 2017-11-28 Patrick Morton

In the present paper, the existence and multiplicity problems of extensions are addressed. The focus is on extension of the stable type. The main result of the paper is an elegant characterization of the existence and multiplicity of…

Artificial Intelligence · Computer Science 2007-05-23 Bart Verheij

This note presents an extension to the adaptive control strategy presented in [1] able to counter eventual instability due to disturbances at the input of an otherwise $\mathcal{L}_2$ stable closed-loop system. These disturbances are due to…

Optimization and Control · Mathematics 2015-05-20 Mario di Bernardo , Umberto Montanaro , Romeo Ortega , Stefania Santini

We show analogues of the classical Krein-Milman theorem for several ordered algebraic structures, especially in a semilattice (non-linear) framework. In that case, subsemilattices are seen as convex subsets, and for our proofs we use…

Functional Analysis · Mathematics 2014-05-30 Paul Poncet

We prove a Krieger like embedding theorem for asymptotically expansive systems with the small boundary property. We show that such a system $(X; T)$ embeds in the $K$-full shift with $h_{top}(T) < \log K $ and $\sharp Per_n(X; T) \leq…

Dynamical Systems · Mathematics 2017-05-25 David Burguet