English
Related papers

Related papers: Moving up and down in the generic multiverse

200 papers

This survey discusses how recent developments in multimodal processing facilitate conceptual grounding of language. We categorize the information flow in multimodal processing with respect to cognitive models of human information processing…

Computation and Language · Computer Science 2019-07-04 Lisa Beinborn , Teresa Botschen , Iryna Gurevych

We first demonstrate how our general intuition of pseudoforces has to navigate around several pitfalls in rotating frames. And then, we proceed to develop an intuitive understanding of the different components of the pseudoforces in most…

Classical Physics · Physics 2020-11-26 Ujan Chakraborty , Ananda Dasgupta

We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which…

Logic in Computer Science · Computer Science 2015-11-16 Luc Dartois , Charles Paperman

We analyse a mechanical system in two-dimensional relative motion with friction. Although the system is simple, the peculiar interplay between two kinetic friction forces and gravity leads to the wide range of admissible solutions exceeding…

Physics Education · Physics 2007-05-23 Dariusz Grech , Zygmunt Mazur

The possibility that the multiverse corresponds to physical reality deserves serious investigation. Having three different important theories,(quantum mechanics, string theory and inflation), predict the existence of the multiverse is…

General Relativity and Quantum Cosmology · Physics 2008-04-29 Laura Mersini-Houghton

This paper belongs to the field of probabilistic modal logic, focusing on a comparative analysis of two distinct semantics: one rooted in Kripke semantics and the other in neighbourhood semantics. The primary distinction lies in the…

Logic · Mathematics 2024-04-25 Nino Guallart

We present a modal logic based approach to the so-called endophysical quantum universe. In particular, we treat the problem of preferred bases and that of state reduction by employing an eclectic collection of methods including Baltag's…

Quantum Physics · Physics 2007-05-23 A. M. Lisewski

The primary goal of this paper is to recast the semantics of modal logic, and dynamic epistemic logic (DEL) in particular, in category-theoretic terms. We first review the category of relations and categories of Kripke frames, with…

Logic in Computer Science · Computer Science 2017-07-28 Kohei Kishida

In modal logic, semantic consequence is usually defined locally by truth preservation at all worlds in all models (with respect to a class of frames). It can also be defined globally by truth preservation in all models (with respect to a…

Logic in Computer Science · Computer Science 2019-10-08 Xuefeng Wen

Building on our previous work on hybrid polyadic modal logic we identify modal logic equivalents for Matching Logic, a logic for program specification and verification. This provides a rigorous way to transfer results between the two…

Logic in Computer Science · Computer Science 2019-09-05 Ioana Leuştean , Natalia Moangă , Traian Florin Şerbănuţă

Modal logics are widely used in multi-agent systems to reason about actions, abilities, norms, or epistemic states. Combined with description logic languages, they are also a powerful tool to formalise modal aspects of ontology-based…

Logic in Computer Science · Computer Science 2023-07-25 Tiziano Dalmonte , Andrea Mazzullo , Ana Ozaki , Nicolas Troquard

We study the relation between additivity and deduction theorems in the algebraic semantics of congruential modal logic. Additivity of the modal operator is well-known to imply the local deduction-detachment theorem. Our main theme is that…

Logic · Mathematics 2026-03-19 Zalán Gyenis , Zalán Molnár , Övge Öztürk

This paper argues for a modal view of probability. The syntax and semantics of one particularly strong probability logic are discussed and some examples of the use of the logic are provided. We show that it is both natural and useful to…

Artificial Intelligence · Computer Science 2013-04-10 Alan M. Frisch , Peter Haddawy

We study the relative succinctness and expressiveness of modal logics, and prove that these relationships can be as complex as any countable partial order. For this, we use two uniform formalisms to define modal operators, and obtain…

Logic in Computer Science · Computer Science 2014-10-23 Henning Schnoor

We provide a simple translation of the satisfiability problem for regular grammar logics with converse into GF2, which is the intersection of the guarded fragment and the 2-variable fragment of first-order logic. This translation is…

Logic in Computer Science · Computer Science 2009-09-29 Stephane Demri , Hans de Nivelle

Hilbert's Entscheidungsproblem has given rise to a broad and productive line of research in mathematical logic, where the classification process of decidable classes of first-order sentences represent only one of the remarkable results.…

Logic in Computer Science · Computer Science 2014-04-15 Fabio Mogavero , Giuseppe Perelli

The present work presents some results about the categorial relation between logics and its categories of structures. A (propositional, finitary) logic is a pair given by a signature and Tarskian consequence relation on its formula algebra.…

Category Theory · Mathematics 2016-03-04 Darllan Conceição Pinto , Hugo Luiz Mariano

Possibilistic logic offers a qualitative framework for representing pieces of information associated with levels of uncertainty of priority. The fusion of multiple sources information is discussed in this setting. Different classes of…

Artificial Intelligence · Computer Science 2013-01-18 Salem Benferhat , Didier Dubois , Souhila Kaci , Henri Prade

A policy describes the conditions under which an action is permitted or forbidden. We show that a fragment of (multi-sorted) first-order logic can be used to represent and reason about policies. Because we use first-order logic, policies…

Logic in Computer Science · Computer Science 2007-05-23 Joseph Y. Halpern , Vicky Weissman

Similar to modal connectives, the exponential ! in intuitionistic linear logic (ILL) is not canonical, in the sense that if $i\not= j$ then $!^i F\not\equiv !^j F$. Intuitively, this means that we can mark the exponential with labels taken…

Logic in Computer Science · Computer Science 2024-04-18 Carlos Olarte , Elaine Pimentel