English
Related papers

Related papers: Strict potentialism in modal mirrors

200 papers

Cathoristic logic is a multi-modal logic where negation is replaced by a novel operator allowing the expression of incompatible sentences. We present the syntax and semantics of the logic including complete proof rules, and establish a…

Logic in Computer Science · Computer Science 2014-11-27 Richard Prideaux Evans , Martin Berger

A potentialist system is a first-order Kripke model based on embeddings. I define the notion of bisimulation for these systems, and provide a number of examples. Given a first-order theory $T$, the system $\mathrm{Mod}(T)$ consists of all…

Logic · Mathematics 2022-06-23 Sam Adam-Day

We develop a constructive theory of continuous domains from the perspective of program extraction. Our goal that programs represent (provably correct) computation without witnesses of correctness is achieved by formulating correctness…

Logic in Computer Science · Computer Science 2023-06-22 Dirk Pattinson , Mina Mohammadian

This draft introduces the technical machinery of a semantic framework for potentialist truthmaking based on our innovation of intentic states, which are structured partial models accounting for our distinction between non-hypothetical and…

Logic in Computer Science · Computer Science 2026-02-05 Paul Gorbow

Over the last two decades, there has been an extensive study on logical formalisms for specifying and verifying real-time systems. Temporal logics have been an important research subject within this direction. Although numerous logics have…

Logic in Computer Science · Computer Science 2013-08-06 Savas Konur

The provability logic of a theory T is the set of modal formulas, which under any arithmetical realization are provable in T . We slightly modify this notion by requiring the arithmetical realizations to come from a specified set $\Gamma$.…

Logic · Mathematics 2020-06-19 Thomas F. Icard , Joost J. Joosten

Selective rationalization has become a common mechanism to ensure that predictive models reveal how they use any available features. The selection may be soft or hard, and identifies a subset of input features relevant for prediction. The…

Computation and Language · Computer Science 2019-12-17 Mo Yu , Shiyu Chang , Yang Zhang , Tommi S. Jaakkola

Making a linguistic theory is like making a programming language: one typically devises a type system to delineate the acceptable utterances and a denotational semantics to explain observations on their behavior. Via this connection, the…

Computation and Language · Computer Science 2007-05-23 Chung-chieh Shan

Every countable language which conforms to classical logic is shown to have an extension which conforms to classical logic, and has a definitional theory of truth. That extension has a semantical theory of truth, if every sentence of the…

Logic · Mathematics 2020-02-04 Seppo Heikkilä

In this work, we present a logical formalism for reasoning about quantum systems in finite dimension. Contrary to the usual approach in quantum logic, our formalism is based classical first-order logic, which allows us to use the tools of…

Quantum Physics · Physics 2026-02-19 Olivier Brunet

A semantics is given to possibilistic logic, a logic that handles weighted classical logic formulae, and where weights are interpreted as lower bounds on degrees of certainty or possibility, in the sense of Zadeh's possibility theory. The…

Artificial Intelligence · Computer Science 2013-03-26 Jerome Lang , Didier Dubois , Henri Prade

All constructive methods employed in modern mathematics produce only countable sets, even when designed to transcend countability. We show that any constructive argument for uncountability -- excluding diagonalization techniques --…

General Mathematics · Mathematics 2025-05-28 Stanislav Semenov

The computational properties of modal and propositional dependence logics have been extensively studied over the past few years, starting from a result by Sevenster showing NEXPTIME-completeness of the satisfiability problem for modal…

Logic in Computer Science · Computer Science 2023-06-22 Miika Hannula

The Jost function formalism is extended with use of the complex potential in this paper. We derive the Jost function by taking into account the dual state which is defined by the complex conjugate the complex Hamiltonian. By using the…

Nuclear Theory · Physics 2021-03-01 K. Mizuyama , T. Dieu Thuy , N. Hoang Tung , D. Quang Tam , T. V. Nhan Hao

In this chapter we survey two topics that have recently been investigated in frame theory. First, we give an overview of the class of scalable frames. These are (finite) frames with the property that each frame vector can be rescaled in…

Functional Analysis · Mathematics 2016-01-19 Kasso A. Okoudjou

We propose an extension of Poole's independent choice logic based on a relaxation of the underlying independence assumptions. A credal semantics involving multiple joint probability mass functions over the possible worlds is adopted. This…

Logic in Computer Science · Computer Science 2018-06-22 Alessandro Antonucci , Alessandro Facchini

This paper presents four theorems that connect continuity postulates in mathematical economics to solvability axioms in mathematical psychology, and ranks them under alternative supplementary assumptions. Theorem 1 connects notions of…

Theoretical Economics · Economics 2022-04-12 Aniruddha Ghosh , M. Ali Khan , Metin Uyanik

Multi-dimensional complex optical potentials with partial parity-time (PT) symmetry are proposed. The usual PT symmetry requires that the potential is invariant under complex conjugation and simultaneous reflection in all spatial…

Pattern Formation and Solitons · Physics 2015-06-18 Jianke Yang

In this paper (propositional) probability logic ($PL$) is investigated from model theoretic point of view. First of all, the ultraproduct construction is adapted for $\sigma$-additive probability models, and subsequently when this class of…

Logic · Mathematics 2018-10-18 Massoud Pourmahdian , Reihane Zoghifard

Differential passivity is a property that allows to check with a pointwise criterion that a system is incrementally passive, a property that is relevant to study interconnected systems in the context of regulation, synchronization, and…

Systems and Control · Computer Science 2016-11-15 Fulvio Forni , Rodolphe Sepulchre , Arjan van der Schaft