English
Related papers

Related papers: Knowledge Theoretic Properties of Topological Spac…

200 papers

There has been an increasing interest in topological semantics for epistemic logic, which has been shown to be useful for, e.g., modelling evidence, degrees of belief, and self-reference. We introduce a polytopological PDL capable of…

Logic in Computer Science · Computer Science 2026-02-17 Martín Diéguez , David Fernández-Duque

Topological models of empirical and formal inquiry are increasingly prevalent. They have emerged in such diverse fields as domain theory [1, 16], formal learning theory [18], epistemology and philosophy of science [10, 15, 8, 9, 2],…

Machine Learning · Computer Science 2017-08-01 Konstantin Genin , Kevin T. Kelly

This paper presents a bimodal logic for reasoning about knowledge during knowledge acquisition. One of the modalities represents (effort during) non-deterministic time and the other represents knowledge. The semantics of this logic are…

Logic in Computer Science · Computer Science 2007-05-23 Konstantinos Georgatos

In recent work, Stalnaker proposes a logical framework in which belief is realized as a weakened form of knowledge. Building on Stalnaker's core insights, and using frameworks developed in previous work by Bjorndahl and Baltag et al., we…

Logic in Computer Science · Computer Science 2020-11-25 Adam Bjorndahl , Aybüke Özgün

In recent work, Stalnaker proposes a logical framework in which belief is realized as a weakened form of knowledge. Building on Stalnaker's core insights, and using frameworks developed by Bjorndahl and Baltag et al., we employ topological…

Logic in Computer Science · Computer Science 2017-08-01 Adam Bjorndahl , Aybüke Özgün

Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces---so-called ``topological semantics''. The first is classical higher-order logic, with…

Logic · Mathematics 2023-03-31 Steve Awodey , Carsten Butz

We prove a topological completeness theorem for the modal logic GLP containing operators $\langle\lambda\rangle$ for $\lambda \in$ Ord intended to capture progressively stronger notions of consistency in mathematical theories. We show that,…

Logic · Mathematics 2019-05-07 Juan P. Aguilera

We systematically study some basic properties of the theory of pre-topological spaces, such as, pre-base, subspace, axioms of separation, connectedness, etc. Pre-topology is also known as knowledge space in the theory of knowledge…

General Topology · Mathematics 2021-11-30 Fucai Lin , Xiyan Cao , Jinjin Li

We show that descriptive complexity's result extends in High Order Logic to capture the expressivity of Turing Machine which have a finite number of alternation and whose time or space is bounded by a finite tower of exponential. Hence we…

Logic in Computer Science · Computer Science 2014-07-16 Arthur Milchior

In this thesis we shall present two logical systems, MP and MP, for the purpose of reasoning about knowledge and effort. These logical systems will be interpreted in a spatial context and therefore, the abstract concepts of knowledge and…

Logic in Computer Science · Computer Science 2007-05-23 Konstantinos Georgatos

Understanding the uncertainty in large language model (LLM) explanations is important for evaluating their faithfulness and reasoning consistency, and thus provides insights into the reliability of LLM's output regarding a question. In this…

Computation and Language · Computer Science 2025-09-16 Longchao Da , Xiaoou Liu , Jiaxin Dai , Lu Cheng , Yaqing Wang , Hua Wei

Provability logic concerns the study of modality $\Box$ as provability in formal systems such as Peano arithmetic. Natural, albeit quite surprising, topological interpretation of provability logic has been found in the 1970's by Harold…

Logic · Mathematics 2012-10-30 Lev Beklemishev , David Gabelaia

Spatial aspects of computation are becoming increasingly relevant in Computer Science, especially in the field of collective adaptive systems and when dealing with systems distributed in physical space. Traditional formal verification…

Logic in Computer Science · Computer Science 2019-03-14 Vincenzo Ciancia , Diego Latella , Michele Loreti , Mieke Massink

Provability logic GLP is well-known to be incomplete w.r.t. Kripke semantics. A natural topological semantics of GLP interprets modalities as derivative operators of a polytopological space. Such spaces satisfying all the axioms of GLP are…

Logic · Mathematics 2016-02-19 Lev D. Beklemishev , David Gabelaia

The interplay between process behaviour and spatial aspects of computation has become more and more relevant in Computer Science, especially in the field of collective adaptive systems, but also, more generally, when dealing with systems…

Logic in Computer Science · Computer Science 2014-06-27 Vincenzo Ciancia , Diego Latella , Michele Loreti , Mieke Massink

Finiteness spaces constitute a categorical model of Linear Logic (LL) whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefschetz in 1942) and morphisms as continuous linear maps.…

Logic in Computer Science · Computer Science 2009-12-15 Christine Tasson

Represented spaces form the general setting for the study of computability derived from Turing machines. As such, they are the basic entities for endeavors such as computable analysis or computable measure theory. The theory of represented…

Logic · Mathematics 2015-03-04 Arno Pauly

Knowledge is a network of interconnected concepts. Yet, precisely how the topological structure of knowledge constrains its acquisition remains unknown, hampering the development of learning enhancement strategies. Here we study the…

Computation and Language · Computer Science 2021-03-17 Nicolas H. Christianson , Ann Sizemore Blevins , Danielle S. Bassett

We show that the intuitionistic propositional logic with a Galois connection (IntGC), introduced by the authors, has the finite model property.

Logic · Mathematics 2014-03-26 Wojciech Dzik , Jouni Järvinen , Michiro Kondo

The paper investigates an evidence-based semantics for epistemic logics. It is shown that the properties of knowledge obtained from a potentially infinite body of evidence are described by modal logic S5. At the same time, the properties of…

Logic in Computer Science · Computer Science 2021-06-23 Pavel Naumov , Jia Tao
‹ Prev 1 2 3 10 Next ›