Search arXivSearch

arXiv · 1811.01590

Putting the Agents back in the Domain: A Two-Sorted Term-Modal Logic

Abstract

In the present paper syntax and semantics will be presented for an expansion of ordinary n-agent QML with constant domain, non-rigid constants, rigid variables and including both functions, relations, and equality. Further, the number of agents will be specified axiomatically thus ensuring maximal flexibility wrt. the cardinality of the set of agents. Domain, variables, and constants will be partitioned in an agent-part and an object-part and the syntax will be expanded to include strings in which indexes of modal operators are quantified over as wff's of the language. This will enhance expressiveness regarding the epistemic status of agents. Such a term-modal version of the logic K is shown to be sound and complete wrt. the class of (appropriate) frames, and a term-version of S4 is shown to be sound and complete wrt. the class of (appropriate) frames in which the relations are transitive. It should be noted that completeness is shown via the framework of canonical models and thus allows for non-complicated generalizations to other logics than the term-versions of K and S4.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Andreas Achen. 2018-11-05. Putting the Agents back in the Domain: A Two-Sorted Term-Modal Logic. https://arxiv.org/abs/1811.01590

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deciding Predicate Logical Theories of Real-Valued Functions

The notion of a real-valued function is central to mathematics, computer science, and many other scientific fields. Despite this importance, there are hardly any positive results on decision procedures for predicate logical theories that reason about real-valued functions. This paper defines a first-order predicate language for reasoning about multi-dimensional smooth real-valued functions and their derivatives, and demonstrates that - despite the obvious undecidability barriers - certain positive decidability results for such a language are indeed possible.

cs.LO

Structural Liveness of Conservative Petri Nets

We show that the EXPSPACE-hardness result for structural liveness of Petri nets [Jancar and Purser, 2019] holds even for a simple subclass of conservative nets. As our main result, we prove that for structurally live conservative nets, the values of the minimal live markings are at most doubly exponential in the size of the net. This implies the EXPSPACE-completeness of structural liveness for conservative Petri nets. The result also applies to structurally bounded Petri nets, whereas the complexity of the general case remains open. As a proof ingredient of independent interest, we present an extension of known results on the bounds of minimal integer solutions to Boolean combinations of linear equalities, inequalities, and divisibility constraints.

cs.LO

Verifying Numerical Methods with Isabelle/HOL

Modern machine learning pipelines and ODE solvers are built on numerical algorithms. Reliable numerical methods are thus a prerequisite for trustworthy machine learning and cyber-physical systems. We evaluate a framework designed for verifying imperative programs and the Isabelle proof assistant as tools for proving the total correctness of four numerical algorithms: the bisection method, the fixed-point method, the perceptron, and the gradient descent algorithm. Our verifications required subtle extensions and generalisations to Isabelle's version of Taylor's theorem and higher-order derivatives. Finally, we reflect on the framework's automation, friendly syntax, and on further requirements to turn it into a verification tool for numerical methods.

cs.LO