Related papers: Questions and dependency in intuitionistic logic
In this paper we make a contribution to the unification of formal models of defeasible reasoning. We present several translations between formal argumentation frameworks and nonmonotonic logics for reasoning with plausible assumptions. More…
In [17], we introduced a modal logic, called $L$, which combines intuitionistic propositional logic $IPC$ and classical propositional logic $CPC$ and is complete w.r.t. an algebraic semantics. However, $L$ seems to be too weak for…
This note is concerned with a formal analysis of the problem of non-monotonic reasoning in intelligent systems, especially when the uncertainty is taken into account in a quantitative way. A firm connection between logic and probability is…
Within classical propositional logic, assigning probabilities to formulas is shown to be equivalent to assigning probabilities to valuations. A novel notion of probabilistic entailment enjoying desirable properties of logical consequence is…
We introduce a generalization of team semantics which provides a framework for manipulationist theories of causation based on structural equation models, such as Woodward's and Pearl's; our causal teams incorporate (partial or total)…
We study the expressive power of fragments of inclusion and independence logic defined either by restricting the number of universal quantifiers or the arity of inclusion and independence atoms in formulas. Assuming the so-called lax…
On the one hand, classical logic is an extremely successful theory, even if not being perfect. On the other hand, intuitionistic logic is, without a doubt, one of the most important non-classical logics. But, how can proponents of one logic…
In this paper a conditional logic is defined and studied. This conditional logic, DmBL, is constructed as a deterministic counterpart to the Bayesian conditional. The logic is unrestricted, so that any logical operations are allowed. A…
We propose four axiomatic systems for intuitionistic linear temporal logic and show that each of these systems is sound for a class of structures based either on Kripke frames or on dynamic topological systems. Our topological semantics…
The proof theory and semantics of intuitionistic modal logics have been studied by Simpson in terms of Prawitz-style labelled natural deduction systems and Kripke models. An alternative to model-theoretic semantics is provided by…
We give a calculus for reasoning about the first-order fragment of classical logic that is adequate for giving the truth conditions of intuitionistic Kripke frames, and outline a proof-theoretic soundness and completeness proof, which we…
The Kripke semantics of classical propositional normal modal logic is made algebraic via an embedding of Kripke structures into the larger class of pointed stably supported quantales. This algebraic semantics subsumes the traditional…
Predicate intuitionistic logic is a well established fragment of dependent types. According to the Curry-Howard isomorphism proof construction in the logic corresponds well to synthesis of a program the type of which is a given formula. We…
We present Dynamic Epistemic Temporal Logic, a framework for reasoning about operations on multi-agent Kripke models that contain a designated temporal relation. These operations are natural extensions of the well-known "action models" from…
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 study knowable informational dependence between empirical questions, modeled as continuous functional dependence between variables in a topological setting. We also investigate epistemic independence in topological terms and show that it…
We define a family of intuitionistic non-normal modal logics; they can bee seen as intuitionistic counterparts of classical ones. We first consider monomodal logics, which contain only one between Necessity and Possibility. We then consider…
Quantified propositional intuitionistic logic is obtained from propositional intuitionistic logic by adding quantifiers \forall p, \exists p over propositions. In the context of Kripke semantics, a proposition is a subset of the worlds in a…
A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…
We study various notions of dependency in semiring team semantics. Semiring teams are essentially database relations, where each tuple is annotated with some element from a positive semiring. We consider semiring generalizations of several…