Related papers: Montague's Paradox without Necessitation
We prove a version of the fundamental theorems of Morse Theory in the setting of finite spaces or partially ordered sets. By using these results we extend Forman's discrete Morse theory to more general cell complexes and derive the…
Entropic Dynamics is a framework in which dynamical laws such as those that arise in physics are derived as an application of entropic methods of inference. No underlying action principle is postulated. Instead, the dynamics is driven by…
An ordinal view of independence is studied in the framework of possibility theory. We investigate three possible definitions of dependence, of increasing strength. One of them is the counterpart to the multiplication law in probability…
Logical systems with classical negation and means for sentential or propositional self-reference involve, in some way, paradoxical statements such as the liar. However, the paradox disappears if one replaces classical by an appropriate…
For infinite machines which are free from the classical Thompson's lamp paradox we show that they are not free from its inverted version. We provide a program for infinite machines and an infinite mechanism which simulate this paradox.…
We consider a homogeneous system of linear equations of the form $A_\alpha^{\otimes N} {\bf x} = 0$ arising from the distinguishability of two quantum operations by $N$ uses in parallel, where the coefficient matrix $A_\alpha$ depends on a…
An Independent Parallelism Theorem is proven in the theory of adhesive HLR categories. It shows the bijective correspondence between sequential independent and parallel independent direct derivations in the Weak Double-Pushout framework,…
We suggest a forcing version of Yablo's paradox and discuss its implication on self-reference.
The computational properties of modal and propositional dependence logics have been extensively studied over the past few years, starting from a result by Sevenster showing NEXPTIME-completeness of the satisfiability problem for modal…
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…
We look at non-classical negations and their corresponding adjustment connectives from a modal viewpoint, over complete distributive lattices, and apply a very general mechanism in order to offer adequate analytic proof systems to logics…
Necessary and/or sufficient conditions are studied for the existence, uniqueness and holonomicity of bases in which on sufficiently general subsets of a differentiable manifold the components of derivations of the tensor algebra over it…
We combine linear temporal logic (with both past and future modalities) with a deontic version of justification logic to provide a framework for reasoning about time and epistemic and normative reasons. In addition to temporal modalities,…
Attempts to replicate probabilistic reasoning in expert systems have typically overlooked a critical ingredient of that process. Probabilistic analysis typically requires extensive judgments regarding interdependencies among hypotheses and…
We prove some new results on existence of solutions to first--order ordinary differential equations with deviating arguments. Delay differential equations are included in our general framework, which even allows deviations to depend on the…
Recently, it has been shown that probabilistic entailment under coherence is weaker than model-theoretic probabilistic entailment. Moreover, probabilistic entailment under coherence is a generalization of default entailment in System P. In…
In previous articles we presented a simple set of axioms named Contexts, Systems and Modalities (CSM), where the structure of quantum mechanics appears as a result of the interplay between the quantized number of modalities accessible to a…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
In this paper we provide a theoretical analysis of counterfactual invariance. We present a variety of existing definitions, study how they relate to each other and what their graphical implications are. We then turn to the current major…
Different notions of the consistency of obligations collapse in standard deontic logic. In justification logics, which feature explicit reasons for obligations, the situation is different. Their strength depends on a constant specification…