The aim of this paper is to study the n-variable fragment of first order logic from a modal perspective. We define a modal formalism called cylindric mirror modal logic, and show how it is a modal version of first order logic with substitution. In this approach, we can define a semantics for the language which is closely related to algebraic logic, as we find Polyadic Equality Algebras as the modal or complex algebras of our system. The main contribution of the paper is a characterization of the intended 'mirror cubic' frames of the formalisms and, a consequence of the special form of this characterization, a completeness theorem for these intended frames. As a consequence, we find complete finite yet unorthodox derivation systems f...
In previous work we gave an approach, based on labelled natural deduction, for formalizing proof sys...
In this paper we present a translation principle, called the axiomatic translation, for reducing pro...
The aim of this paper is to give a new proof for the decidability and finite model property of first...
Abstract. The aim of this paper is to study the n-variable fragment of first order logic from a moda...
Treating the existential quantification ∃vi as a diamond 3i and the identity vi = vj as a constant δ...
The formalism of cylindric modal logic can be motivated from two directions. In its own right, it fo...
In this paper we develop a modal formalism called cylindric modal logic we investigate its basic se...
The study of modal logic often starts with that of unary operators applied to sentences, denoting so...
In Conradie, Goranko, and Vakarelov (2006, Logical Methods in Computer Science, 2) we introduced a n...
We define an interpretation of modal languages with polyadic operators in modal languages that use m...
The one-variable fragment of any first-order logic may be considered as a modal logic, where the uni...
Abstract: The nonmonotonic logic called Reflective Logic is shown to be representable in a monotonic...
In previous work we gave an approach, based on labelled natural deduction, for formalizing proof sys...
Modal Logic is traditionally concerned with the intensional operators “possibly ” and “necessary”, w...
In previous work we gave an approach, based on labelled natural deduction, for formalizing proof sys...
In previous work we gave an approach, based on labelled natural deduction, for formalizing proof sys...
In this paper we present a translation principle, called the axiomatic translation, for reducing pro...
The aim of this paper is to give a new proof for the decidability and finite model property of first...
Abstract. The aim of this paper is to study the n-variable fragment of first order logic from a moda...
Treating the existential quantification ∃vi as a diamond 3i and the identity vi = vj as a constant δ...
The formalism of cylindric modal logic can be motivated from two directions. In its own right, it fo...
In this paper we develop a modal formalism called cylindric modal logic we investigate its basic se...
The study of modal logic often starts with that of unary operators applied to sentences, denoting so...
In Conradie, Goranko, and Vakarelov (2006, Logical Methods in Computer Science, 2) we introduced a n...
We define an interpretation of modal languages with polyadic operators in modal languages that use m...
The one-variable fragment of any first-order logic may be considered as a modal logic, where the uni...
Abstract: The nonmonotonic logic called Reflective Logic is shown to be representable in a monotonic...
In previous work we gave an approach, based on labelled natural deduction, for formalizing proof sys...
Modal Logic is traditionally concerned with the intensional operators “possibly ” and “necessary”, w...
In previous work we gave an approach, based on labelled natural deduction, for formalizing proof sys...
In previous work we gave an approach, based on labelled natural deduction, for formalizing proof sys...
In this paper we present a translation principle, called the axiomatic translation, for reducing pro...
The aim of this paper is to give a new proof for the decidability and finite model property of first...