Combining Unification and Rewriting in Proofs for Modal Logics With First-Order Undefinable Frames

doi 10.2991/icmmct-17.2017.140
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Atlantis Press

Related search

First-Order Resolution Methods for Modal Logics

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Modal Logics of Reactive Frames

Cognitive Technologies
2013English

Undecidability of Modal and Intermediate First-Order Logics With Two Individual Variables

Journal of Symbolic Logic
PhilosophyLogic
1993English

Unification in Epistemic Logics

Journal of Applied Non-Classical Logics
PhilosophyLogic
2017English

Separation Logic Adapted for Proofs by Rewriting

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

First-Order Logics of Branching Time

Logical Investigations
2013English

Comparing Unification Algorithms in First-Order Theorem Proving

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Modal Logics for Continuous Dynamics

1997English

Sequent Systems for Modal Logics

2002English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy