中文
相关论文

相关论文: The modal logic of set-theoretic potentialism and …

200 篇论文

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…

逻辑 · 数学 2025-12-23 Joel David Hamkins

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…

逻辑 · 数学 2020-07-06 Raffaella Cutolo , Joel David Hamkins

The modal logic of forcing arises when one considers a model of set theory in the context of all its forcing extensions, interpreting necessity as "in all forcing extensions" and possibility as "in some forcing extension". In this modal…

逻辑 · 数学 2012-07-26 Joel David Hamkins , George Leibman , Benedikt Löwe

We classify the propositional modal validities arising from the category of sets under its natural classes of morphisms. The resulting validities depend on the morphism class, the size of the world, and the permitted substitution instances.…

逻辑 · 数学 2026-04-29 Wojciech Aleksander Wołoszyn

Modal logic S5 has attracted significant attention and has led to several practical applications, owing to its simplified approach to dealing with nesting modal operators. Efficient implementations for evaluating satisfiability of S5…

人工智能 · 计算机科学 2023-06-22 Mario Alviano , Sotiris Batsakis , George Baryannis

For each natural number $n$ we study the modal logic determined by the class of transitive Kripke frames in which there are no cycles of length greater than $n$ and no strictly ascending chains. The case $n=0$ is the G\"odel-L\"ob…

逻辑 · 数学 2023-11-08 Robert Goldblatt

This paper proposes a basic proof theoretic framework for major modal logics: {\sf S5} and some of its subsystems. The framework is based on a version of hypersequent calculus, and the basic modal systems we handle here are the system {\sf…

计算机科学中的逻辑 · 计算机科学 2026-05-19 Hirohiko Kushida

Potentialism is the view that objects are successively generated in an incompletable process. A strict version of the view adds that truths are successively determined. Strict potentialism can be analyzed using two modalities: one for the…

逻辑 · 数学 2026-04-21 Ø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,…

逻辑 · 数学 2026-05-08 Hope Duncan

I introduce modal group theory, in which we study the category of all groups, considering embeddability as providing a notion of modal possibility. Using HNN extensions and Britton's lemma, I demonstrate that the modal language of groups is…

逻辑 · 数学 2026-05-15 Wojciech Aleksander Wołoszyn

Within the possibilistic approach to uncertainty modeling, the paper presents a modal logical system to reason about qualitative (comparative) statements of the possibility (and necessity) of fuzzy propositions. We relate this qualitative…

计算机科学中的逻辑 · 计算机科学 2013-02-28 Petr Hajek , Dagmar Harmancová , Francesc Esteva , Pere Garcia , Lluis Godo

The forcing method is a powerful tool to prove the consistency of set-theoretic assertions relative to the consistency of the axioms of set theory. Laver's theorem and Bukovsk\'y's theorem assert that set-generic extensions of a given…

逻辑 · 数学 2016-07-07 Sy David Friedman , Sakaé Fuchino , Hiroshi Sakai

I investigate modal group theory for arbitrary homomorphisms. Possibility is interpreted by the existence of a group homomorphism out of the given group, so the semantics is governed by the possibility of collapse: elements may be…

逻辑 · 数学 2026-05-15 Wojciech Aleksander Wołoszyn

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…

逻辑 · 数学 2025-01-22 Wesley H. Holliday

Solovay's arithmetical completeness theorem states that the modal logic of provability coincides with the modal logic $\mathbf{GL}$. Hamkins and L\"owe studied the modal logical aspects of set theoretic multiverse and proved that the modal…

逻辑 · 数学 2023-11-02 Taishi Kurahashi , Rihito Takase

We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the problem's combinatorial explosion, beyond the number of…

计算机科学中的逻辑 · 计算机科学 2009-12-31 Antonis Achilleos , Michael Lampis , Valia Mitsou

We introduce the subject of modal model theory, where one studies a mathematical structure within a class of similar structures under an extension concept that gives rise to mathematically natural notions of possibility and necessity. A…

逻辑 · 数学 2020-09-22 Joel David Hamkins , Wojciech Aleksander Wołoszyn

What are the most general principles in set theory relating forceability and truth? As with Solovay's celebrated analysis of provability, both this question and its answer are naturally formulated with modal logic. We aim to do for…

逻辑 · 数学 2007-05-23 Joel David Hamkins , Benedikt Loewe

Graded modal logic is the formal language obtained from ordinary (propositional) modal logic by endowing its modal operators with cardinality constraints. Under the familiar possible-worlds semantics, these augmented modal operators receive…

计算机科学中的逻辑 · 计算机科学 2024-04-24 Yevgeny Kazakov , Ian Pratt-Hartmann

Possibilistic logic has been proposed as a numerical formalism for reasoning with uncertainty. There has been interest in developing qualitative accounts of possibility, as well as an explanation of the relationship between possibility and…

人工智能 · 计算机科学 2013-03-25 Craig Boutilier
‹ 上一页 1 2 3 10 下一页 ›