English
Related papers

Related papers: Strict potentialism in modal mirrors

200 papers

We explain and explore class-theoretic potentialism -- the view that one can always individuate more classes over a set-theoretic universe. We examine some motivations for class-theoretic potentialism, before proving some results concerning…

Logic · Mathematics 2023-03-16 Neil Barton , Kameryn J. Williams

I investigate the modal commitments of various conceptions of the philosophy of arithmetic potentialism. Specifically, I shall consider the potentialist conceptions arising from a model-theoretic view of the models of arithmetic as possible…

Logic · Mathematics 2025-12-23 Joel David Hamkins

We propose an interpretation of physics named potentiality realism. This view, which can be applied to classical as well as to quantum physics, regards potentialities (i.e. intrinsic, objective propensities for individual events to obtain)…

Quantum Physics · Physics 2024-10-08 Flavio Del Santo , Nicolas Gisin

We present the model theoretic concepts that allow mathematics to be developed with the notion of the potential infinite instead of the actual infinite. The potential infinite is understood as a dynamic notion, being an indefinitely…

Logic · Mathematics 2022-12-16 Matthias Eberl

I shall explore various senses in which ultrafinitism can be fruitfully understood as engaging with a potentialist perspective in mathematics. First, I explain that every model $M$ of the theory of finite arithmetic -- arithmetic with a…

Logic · Mathematics 2025-12-09 Joel David Hamkins

Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…

Logic in Computer Science · Computer Science 2019-01-01 Anantha Padmanabha , R Ramanujam

Possibilistic logic, an extension of first-order logic, deals with uncertainty that can be estimated in terms of possibility and necessity measures. Syntactically, this means that a first-order formula is equipped with a possibility degree…

Artificial Intelligence · Computer Science 2013-02-28 Bernhard Hollunder

This paper develops the model theory of normal modal logics based on partial "possibilities" instead of total "worlds," following Humberstone (1981) instead of Kripke (1963). Possibility semantics can be seen as extending to modal logic the…

Logic · Mathematics 2025-01-22 Wesley H. Holliday

Our understanding about things is conceptual. By stating that we reason about objects, it is in fact not the objects but concepts referring to them that we manipulate. Now, so long just as we acknowledge infinitely extending notions such as…

Artificial Intelligence · Computer Science 2015-04-21 Ryuta Arisaka

In traditional semantics for classical logic and its extensions, such as modal logic, propositions are interpreted as subsets of a set, as in discrete duality, or as clopen sets of a Stone space, as in topological duality. A point in such a…

Logic · Mathematics 2024-05-14 Wesley H. Holliday

We analyze the precise modal commitments of several natural varieties of set-theoretic potentialism, using tools we develop for a general model-theoretic account of potentialism, building on those of Hamkins, Leibman and L\"owe, including…

Logic · Mathematics 2018-08-07 Joel David Hamkins , Øystein Linnebo

Taking symmetric extensions can be considered as a generalisation of forcing, which produces a richer multiverse of models with and without the axiom of choice. We can study the structure of this multiverse using modal logic. In particular,…

Logic · Mathematics 2026-05-08 Hope Duncan

We develop a systematic approach to construct novel completely solvable rational potentials. Second-order supersymmetric quantum mechanics dictates the latter to be isospectral to some well-studied quantum systems. $\cal PT$ symmetry may…

Quantum Physics · Physics 2015-05-13 B. Bagchi , C. Quesne , R. Roychoudhury

Possibilistic computation tree Logic (PoCTL) is one kind of branching temporal logic combined with uncertain information in possibility theory, which was introduced in order to cope with the systematic verification on systems with uncertain…

Logic in Computer Science · Computer Science 2025-10-28 Yongming Li

An ordinal view of independence is studied in the framework of possibility theory. We investigate three possible definitions of dependence, of increasing strength. One of them is the counterpart to the multiplication law in probability…

Artificial Intelligence · Computer Science 2013-02-28 Didier Dubois , Luis Farinas del Cerro , Andreas Herzig , Henri Prade

We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…

Logic in Computer Science · Computer Science 2015-03-20 Hubie Chen

We define a potentialist system of ZF-structures, that is, a collection of possible worlds in the language of ZF connected by a binary accessibility relation, achieving a potentialist account of the full background set-theoretic universe…

Logic · Mathematics 2020-07-06 Raffaella Cutolo , Joel David Hamkins

We present several philosophical ideas emerging from the studies of complex systems. We make a brief introduction to the basic concepts of complex systems, for then defining "abstraction levels". These are useful for representing…

Adaptation and Self-Organizing Systems · Physics 2007-05-23 Carlos Gershenson

We isolate a combinatorial property of capacities leading to a construction of proper forcings. Then we show that many classical capacities such as the Newtonian capacity satisfy the property.

Logic · Mathematics 2007-05-23 Jindrich Zapletal

There is knowledge. There is belief. And there is tacit agreement.' 'We may talk about objects. We may talk about attributes of the objects. Or we may talk both about objects and their attributes.' This work inspects tacit agreements on…

Artificial Intelligence · Computer Science 2014-04-25 Ryuta Arisaka
‹ Prev 1 2 3 10 Next ›