English
Related papers

Related papers: An interesting temporalization of G\"odel's ontolo…

200 papers

Monadic second order logic and linear temporal logic are two logical formalisms that can be used to describe classes of infinite words, i.e., first-order models based on the natural numbers with order, successor, and finitely many unary…

Logic · Mathematics 2016-05-02 Silvio Ghilardi , Samuel J. van Gool

Justification logics are modal-like logics with the additional capability of recording the reason, or justification, for modalities in syntactic structures, called justification terms. Justification logics can be seen as explicit…

Logic in Computer Science · Computer Science 2015-10-27 Samuel Bucheli

Reasoning over OWL 2 is a very expensive task in general, and therefore the W3C identified tractable profiles exhibiting good computational properties. Ontological reasoning for many fragments of OWL 2 can be reduced to the evaluation of…

Artificial Intelligence · Computer Science 2020-03-24 Mario Alviano , Marco Manna

With a view to the results discussed in the first two parts of this paper, the concept of time is revisited oncemore and chosen as an example in order to demonstrate the meaning of fundamental in both physical and philosophical terms. It is…

General Physics · Physics 2007-05-23 Rainer E. Zimmermann

An technically interesting proof of a known theorem.

Analysis of PDEs · Mathematics 2007-05-23 Andreas Wannebo

We investigate ontology-based data access to temporal data. We consider temporal ontologies given in linear temporal logic LTL interpreted over discrete time (Z,<). Queries are given in LTL or MFO(<), monadic first-order logic with a…

Logic in Computer Science · Computer Science 2021-05-26 Alessandro Artale , Roman Kontchakov , Alisa Kovtunova , Vladislav Ryzhikov , Frank Wolter , Michael Zakharyaschev

It is shown that G-up, the quantified propositional Goedel-Dummett logic based on the truth-values set V-up = {1 - 1/n : n >= 1} u {1}, is decidable. This result is obtained by reduction to Buechi's theory S1S. An alternative proof based on…

Logic · Mathematics 2007-05-23 Matthias Baaz , Agata Ciabattoni , Richard Zach

We present a new metric temporal logic HornMTL over dense time and its datalog extension datalogMTL. The use of datalogMTL is demonstrated in the context of ontology-based data access over meteorological data. We show decidability of…

Logic in Computer Science · Computer Science 2017-01-05 Diego Calvanese , Elem Güzel Kalaycı , Vladislav Ryzhikov , Guohui Xiao , Michael Zakharyaschev

In cosmology, we would like to explain our observations and predict future observations from theories of the entire universe. Such cosmological theories make ontological assumptions of what entities exist and what their properties and…

History and Philosophy of Physics · Physics 2014-12-25 Don N. Page

Regarding the famous Sea Battle Argument, which Aristotle presents in De Interpretatione 9, there has never been a general agreement not only about its correctness but also, and mainly, about what the argument really is. According to the…

History and Overview · Mathematics 2023-03-28 Luiz Henrique Lopes dos Santos

Consider the scenario, in which human civilization undergoes periodic eras of progression and regression, and consequently, changes in cosmological knowledge are cyclic. There exist solutions of general theory of relativity, such as the…

General Physics · Physics 2007-05-23 Moninder Singh Modgil

This article surveys work done in the last six years on the unification of various functional interpretations including G\"odel's dialectica interpretation, its Diller-Nahm variant, Kreisel modified realizability, Stein's family of…

Logic · Mathematics 2014-10-17 Paulo Oliva

Lewis' theory of counterfactuals is the foundation of many contemporary notions of causality. In this paper, we extend this theory in the temporal direction to enable symbolic counterfactual reasoning on infinite sequences, such as…

Logic in Computer Science · Computer Science 2023-06-16 Bernd Finkbeiner , Julian Siber

In the literature, two powerful temporal logic formalisms have been proposed for expressing information flow security requirements, that in general, go beyond regular properties. One is classic, based on the knowledge modalities of…

Logic in Computer Science · Computer Science 2014-09-10 Laura Bozzelli , Bastien Maubert , Sophie Pinchinat

We describe the countable ordinals in terms of iterations of Mostowski collapsings. This gives a proof-theoretic bound of definable countable ordinals in the Zermelo-Fraenkel's set theory ZF.

Logic · Mathematics 2013-03-12 Toshiyasu Arai

We consider modeling the conception of knowledge in terms of temporal logic. The study of knowledge logical operations is originated around 1962 by representation of knowledge and belief using modalities. Nowadays, it is very good…

Logic in Computer Science · Computer Science 2014-05-06 Vladimir Rybakov

We investigate a non-classical version of linear temporal logic whose propositional fragment is G\"odel--Dummett logic (which is well known both as a superintuitionistic logic and a t-norm fuzzy logic). We define the logic using two natural…

Logic in Computer Science · Computer Science 2023-01-30 Juan Pablo Aguilera , Martín Diéguez , David Fernández-Duque , Brett McLean

In this note, we combine ideas of several previous proofs in order to obtain a quite short proof of Gr\"otzsch theorem.

Combinatorics · Mathematics 2013-12-02 Zdeněk Dvořák

We give proofs of G\"odel's incompleteness theorems after A. Joyal. The proof uses internal category theory in an arithmetic universe, a predicative generalisation of topoi. Applications to L\"ob's Theorem are discussed.

Category Theory · Mathematics 2020-04-23 Joost van Dijk , Alexander Gietelink Oldenziel

We study an extension of \g propositional logic whose corresponding algebra is an ordered Abelian group. Then we expand the ideas to first-order case of this logic.

Logic · Mathematics 2018-11-09 Seyed Mohammad Amin Khatami