English
Related papers

Related papers: Intransitivity and Vagueness

200 papers

It is well-known that Choice and Regularity are independent of each other but have important common consequences of logical character (reflection principles, representations of classes by sets, etc.). We explain this phenomenon by isolating…

Logic · Mathematics 2007-09-20 Denis I. Saveliev

Conscious states (states that there is something it is like to be in) seem both rich or full of detail, and ineffable or hard to fully describe or recall. The problem of ineffability, in particular, is a longstanding issue in philosophy…

Neurons and Cognition · Quantitative Biology 2023-06-22 Xu Ji , Eric Elmoznino , George Deane , Axel Constant , Guillaume Dumas , Guillaume Lajoie , Jonathan Simon , Yoshua Bengio

If there are fundamental laws of nature, can they fail to be exact? In this paper, I consider the possibility that some fundamental laws are vague. I call this phenomenon 'fundamental nomic vagueness.' I characterize fundamental nomic…

History and Philosophy of Physics · Physics 2022-07-08 Eddy Keming Chen

In the last few decades, numerous experiments have shown that humans do not always behave so as to maximize their material payoff. Cooperative behavior when non-cooperation is a dominant strategy (with respect to the material payoffs) is…

Computer Science and Game Theory · Computer Science 2016-06-27 Valerio Capraro , Joseph Y. Halpern

We interpret homogenousness as a second order property and base it on the same principle as nonmonotonic logic: there might be a small set of exceptions. We use this idea to analyse fundamental questions about defeasible inheritance…

Logic in Computer Science · Computer Science 2019-03-18 Karl Schlechta

Time can be defined as the duration between events. It is irreversible. When used as a variable in quantifying the changing properties of matter, this irreversibility of time is incompatible with Newton's deterministic mechanics and with…

chao-dyn · Physics 2007-05-23 X. de Hemptinne

Exchangeability is a central notion in statistics and probability theory. The assumption that an infinite sequence of data points is exchangeable is at the core of Bayesian statistics. However, finite exchangeability as a statistical…

Artificial Intelligence · Computer Science 2014-04-24 Mathias Niepert , Guy Van den Broeck

We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…

Logic in Computer Science · Computer Science 2023-05-26 Gilles Dowek , Thérèse Hardin , Claude Kirchner

Clear legal language forms the backbone of a contract for numerous reasons. Disputes often arise between contract parties where ambiguous language has been used and parties often disagree on the meaning or effect of the words. Unambiguous…

Computation and Language · Computer Science 2024-10-29 Emily Chivers , Shawn Curran

The Einstein equations allow solutions containing closed timelike curves. These have generated much puzzlement and suspicion that they could imply paradoxes. I show that puzzlement and paradoxes disappears if we discuss carefully the…

General Relativity and Quantum Cosmology · Physics 2019-12-12 Carlo Rovelli

We entertain the idea that the uncertainty relation is not a principle, but rather it is a consequence of quantum mechanics. The uncertainty relation is then a probabilistic statement and can be clearly evaded in processes which occur with…

Quantum Physics · Physics 2011-08-31 Kazuo Fujikawa , Koichiro Umetsu

There are several different common definitions of a property in topological dynamics called "topological transitivity," and it is part of the folklore of dynamical systems that under reasonable hypotheses, they are equivalent. Various…

Dynamical Systems · Mathematics 2012-04-27 Ethan Akin , Jeffrey D. Carlson

If a quantum experiment includes random processes, then the results of repeated measurements can appear consistent with irreversible decoherence even if the system's evolution prior to measurement was reversible and unitary. Two thought…

Quantum Physics · Physics 2012-06-01 Sam Kennerly

In this paper we argue that, to its detriment, transparency research overlooks many foundational concepts of artificial intelligence. As an illustrating example we focus on uncertainty quantification in the context of counterfactual…

Machine Learning · Computer Science 2026-05-19 Kacper Sokol , Santo M. A. R. Thies , Eyke Hüllermeier

The quality of rationales is essential in the reasoning capabilities of language models. Rationales not only enhance reasoning performance in complex natural language tasks but also justify model decisions. However, obtaining impeccable…

Computation and Language · Computer Science 2025-03-05 Hazel H. Kim

Reachability Logic is a formalism that can be used, among others, for expressing partial-correctness properties of transition systems. In this paper we present three proof systems for this formalism, all of which are sound and complete and…

Logic in Computer Science · Computer Science 2019-09-05 Vlad Rusu , David Nowak

Quantum mechanics, devoid of any additional assumption, does not give any theoretical constraint on the projection basis to be used for the measurement process. It is shown in this paper that it does neither allow any physical means for an…

General Physics · Physics 2018-01-17 Hitoshi Inamori

The logic of the hide and seek game LHS was proposed to reason about search missions and interactions between agents in pursuit-evasion environments. As proved in literature, having an equality constant in the language of LHS drastically…

Logic · Mathematics 2023-05-26 Qian Chen , Dazhu Li

An inductive logic can be formulated in which the elements are not propositions or probability distributions, but information systems. The logic is complete for information systems with binary hypotheses, i.e., it applies to all such…

Artificial Intelligence · Computer Science 2013-04-11 Norman C. Dalkey

Type-free systems of logic are designed to consistently handle significant instances of self-reference. Some consistent type-free systems also have the feature of allowing the sort of general abstraction or comprehension principle that…

Logic · Mathematics 2007-05-23 Wayne Aitken , Jeffrey A. Barrett
‹ Prev 1 8 9 10 Next ›