6,412 research outputs found
Clause-Type, Force, and Normative Judgment in the Semantics of Imperatives
I argue that imperatives express contents that are both cognitively and semantically related to, but nevertheless distinct from, modal propositions. Imperatives, on this analysis, semantically encode features of planning that are modally specified. Uttering an imperative amounts to tokening this feature in discourse, and thereby proffering it for adoption by the audience. This analysis deals smoothly with the problems afflicting Portner's Dynamic Pragmatic account and Kaufmann's Modal account. It also suggests an appealing reorientation of clause-type theorizing, in which the cognitive act of updating on a typed sentence plays a central role in theorizing about both its semantics and role in discourse
Towards an Effective Decision Procedure for LTL formulas with Constraints
This paper presents an ongoing work that is part of a more wide-ranging
project whose final scope is to define a method to validate LTL formulas w.r.t.
a program written in the timed concurrent constraint language tccp, which is a
logic concurrent constraint language based on the concurrent constraint
paradigm of Saraswat. Some inherent notions to tccp processes are
non-determinism, dealing with partial information in states and the monotonic
evolution of the information. In order to check an LTL property for a process,
our approach is based on the abstract diagnosis technique. The concluding step
of this technique needs to check the validity of an LTL formula (with
constraints) in an effective way.
In this paper, we present a decision method for the validity of temporal
logic formulas (with constraints) built by our abstract diagnosis technique.Comment: Part of WLPE 2013 proceedings (arXiv:1308.2055
First-order Goedel logics
First-order Goedel logics are a family of infinite-valued logics where the
sets of truth values V are closed subsets of [0, 1] containing both 0 and 1.
Different such sets V in general determine different Goedel logics G_V (sets of
those formulas which evaluate to 1 in every interpretation into V). It is shown
that G_V is axiomatizable iff V is finite, V is uncountable with 0 isolated in
V, or every neighborhood of 0 in V is uncountable. Complete axiomatizations for
each of these cases are given. The r.e. prenex, negation-free, and existential
fragments of all first-order Goedel logics are also characterized.Comment: 37 page
Recommended from our members
Logics of Imprecise Comparative Probability
This paper studies connections between two alternatives to the standard probability calculus for representing and reasoning about uncertainty: imprecise probability andcomparative probability. The goal is to identify complete logics for reasoning about uncertainty in a comparative probabilistic language whose semantics is given in terms of imprecise probability. Comparative probability operators are interpreted as quantifying over a set of probability measures. Modal and dynamic operators are added for reasoning about epistemic possibility and updating sets of probability measures
- …