Three levels of translation into many-sorted logic (original) (raw)
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
We assume the opinion by which "tranlation into classical logic" is a reliable methodology of Universal Logic in the task of comparing different logics. What we add in this paper, following Manzano [9], is some evidence for adopting the slightly different paradigm of "tranlation into many-sorted classical logic." Our own methodology, splitted into three levels of translation, is discussed in some detail.
Related papers
Journal of Philosophical Logic, 32, 259-285, 2003
This paper discusses the general problem of translation functions between logics, given in axiomatic form, and in particular, the problem of determining when two such logics are "synonymous" or "translationally equivalent." We discuss a proposed formal definition of translational equivalence, show why it is reasonable, and also discuss its relation to earlier definitions in the literature. We also give a simple criterion for showing that two modal logics are not translationally equivalent, and apply this to well-known examples. Some philosophical morals are drawn concerning the possibility of having two logical systems that are "empirically distinct" but are both translationally equivalent to a common logic.
New dimensions on translations between logics
After a brief promenade on the several notions of translations that appear in the literature, we concentrate on three paradigms of translations between logics: conservative translations, transfers and contextual translations. Though independent, such approaches are here compared and assessed against questions about the meaning of a translation and about comparative strength and extensibility of a logic with respect to another.
A collection of papers from Paul Hertz to Dov Gabbay - through Tarski, Gödel, Kripke - giving a general perspective about logical systems. These papers discuss questions such as the relativity and nature of logic, present tools such as consequence operators and combinations of logics, prove theorems such as translations between logics, investigate the domain of validity and application of fundamental results such as compactness and completeness. Each of these papers is presented by a specialist explaining its context, import and influence.
2021
In order to prove the validity of logical rules, one has to assume these rules in the metalogic. However, rule-circular 'justifications' are demonstrably without epistemic value (sec. 1). Is a non-circular justification of a logical system possible? This question attains particular importance in view of lasting controversies about classical versus nonclassical logics. In this paper the question is answered positively, based on meaningpreserving translations between logical systems. It is demonstrated that major systems of non-classical logic, including multi-valued, paraconsistent, intuitionistic and quantum logics, can be translated into classical logic by introducing additional intensional operators into the language (sec. 2-5). Based on this result it is argued that classical logic is representationally optimal. In sec. 6 it is investigated whether non-classical logics can be likewise representationally optimal. The answer is predominantly negative but partially positive. Nevertheless the situation is not symmetric, because classical logic has important ceteris paribus advantages as a unifying metalogic.
Journal of Philosophical Logic
In order to prove the validity of logical rules, one has to assume these rules in the metalogic. However, rule-circular ‘justifications’ are demonstrably without epistemic value (sec. 1). Is a non-circular justification of a logical system possible? This question attains particular importance in view of lasting controversies about classical versus non-classical logics. In this paper the question is answered positively, based on meaning-preserving translations between logical systems. It is demonstrated that major systems of non-classical logic, including multi-valued, paraconsistent, intuitionistic and quantum logics, can be translated into classical logic by introducing additional intensional operators into the language (sec. 2–5). Based on this result it is argued that classical logic is representationally optimal. In sec. 6 it is investigated whether non-classical logics can be likewise representationally optimal. The answer is predominantly negative but partially positive. Never...
2021: Why classical logic is privileged: justification of logics based on translatability
Synthese 199, 13067–13094, 2021
In Sect. 1 it is argued that systems of logic are exceptional, but not a priori necessary. Logics are exceptional because they can neither be demonstrated as valid nor be confirmed by observation without entering a circle, and their motivation based on intuition is unreliable. On the other hand, logics do not express a priori necessities of thinking because alternative non-classical logics have been developed. Section 2 reflects the controversies about four major kinds of non-classical logics-multi-valued, intuitionistic, paraconsistent and quantum logics. Its purpose is to show that there is no particular domain or reason that demands the use of a non-classical logic; the particular reasons given for the non-classical logic can also be handled within classical logic. The result of Sect. 2 is substantiated in Sect. 3, where it is shown (referring to other work) that all four kinds of non-classical logics can be translated into classical logic in a meaning-preserving way. Based on this fact a justification of classical logic is developed in Sect. 4 that is based on its representational optimality. It is pointed out that not many but a few non-classical logics can be likewise representationally optimal. However, the situation is not symmetric: classical logic has ceteris paribus advantages as a unifying metalogic, while non-classical logics can have local simplicity advantages.
Multi-Sorted Logic and Logical Geometry: Some Problems
Demonstratio Mathematica, 2015
The paper has a form of a survey on basics of logical geometry and consists of three parts. It is focused on the relationship between many-sorted theory, which leads to logical geometry and one-sorted theory, which is based on important model-theoretic concepts. Our aim is to show that both approaches go in parallel and there are bridges which allow to transfer results, notions and problems back and forth. Thus, an additional freedom in choosing an approach appears. A list of problems which naturally arise in this field is another objective of the paper.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.
References (10)
- van Benthem, J.: Modal Logic and Classical Logic, Bibliopolis, Naples, 1983
- Béziau, J.-Y. (ed.): Logica Universalis, Birkhäuser, Berlin, 2005
- Feferman, S.: "Lectures on proof theory," Proceedings of the Summer School in Logic (Leeds 1967), LNM 70, Springer, Berlin, 1968, pp. 1-107
- Gabbay, D.M. (ed.): What is a Logical System?, Oxford University Press, Oxford, 1994
- Gabbay, D.M.: Labelled Deductive Systems, Volume 1, Oxford University Press, Oxford, 1996
- Gödel, K.: "Eine Interpretation des intuitionistischen Aussagenkalküls," Ergebnisse eines mathematischen Kolloquiums, 4 (1933), pp. 34-40
- Henkin, L.: "Banishing the rule of substitution for functional variables," The Journal of Symbolic Logic, 15, 1953, pp. 81-91
- Hook, J.L.: "A note on interpretations of many-sorted theories," The Jour- nal of Symbolic Logic, 50, 1985, pp. 372-374
- Manzano, M.: Extensions of First Order Logic, Cambridge University Press, Cambridge, 1996
- Meseguer, J.: "General Logics," in Ebbinghaus et al. (eds.): Logic Collo- quium '87, North-Holland, Amsterdam, 1989, pp. 275-239
Related papers
Translation Methods for Non-Classical Logics: An Overview
Logic Journal of IGPL, 1993
This paper gives an overview on translation methods we have developed for nonclassical logics, in particular for modal logics. Optimized 'functional' and semi-functional translation into predicate logic is described. Using normal modal logic as an intermediate logic, other logics can be translated into predicate logic as well. As an example, the translation of modal logic of graded modalities is sketched. In the second part of the paper it is shown how to translate Hilbert axioms into properties of the semantic structure and vice versa, i.e. we can automate important parts of correspondence theory. The exact formalisms and the soundness and completeness proofs can be found in the original papers.
TOWARDS A STRONGER NOTION OF TRANSLATION BETWEEN LOGICS1
The concept of translation between logics was originally introduced in order to prove the consistency of a logic system in terms of the consistency of another logic system. The idea behind this is to interpret (or to encode) a logic into another one. In this survey we address the following question: Which logical properties a (strong) logic translation should preserve? Several approaches to the concept of translation between logics are discussed and analyzed.
2022
This short text contains a rigorous introduction to mathematical logic: Many-sorted Languages are the natural way of formulating mathematical theories. E.g. Category Theory uses two kinds (= sorts) of objects: Sets and classes. Incidence Geometry uses points and lines, and so on. We present a formalism of deduction in many-sorted languages and introduce the notion of models. The main results are the correctness and completeness theorems, the compactness theorem and the theorem of Lindenbaum, all in the many-sorted case. This introduction follows the lines of U. Felgner of the Univerisity of Tübingen, who found this extremely elegant formalism. The autor's contribution was to expand this formalism from one-sorted logic to many-sorted logic.
Towards a stronger notion of translation between logics
The concept of translation between logics was originally introduced in order to prove the consistency of a logic system in terms of the consistency of another logic system. The idea behind this is to interpret (or to encode) a logic into another one. In this survey we address the following question: Which logical properties a (strong) logic translation should preserve? Several approaches to the concept of translation between logics are discussed and analyzed.
Two basic results on translations between logics
2016
The aim of the present paper is to show two basic results concerning translation between logics:[1] The first result establishes that given two logics S1 and S2 with languages L1 and L2, and a translation F of L1 into L2 that interprets S1 into S2, then, given any intermediate logic S3 between S1 and S2, the same translation F interprets S1 into S3.[2] The second result establishes that the translation F cannot interpret S3 into S2.
Defining new universes in many-sorted logic
In this paper we develop definability theory in such a way that we allow to define new elements also, not only new relations on already existing elements. This is in harmony with our everyday mathematical practice, for example we define new entities when we define a geometry over a field. We will see that, in many respects, defining new elements is more harmonious in manysorted logic than in one-sorted logic. In the first part of the paper we develop definability theory allowing to define new entities in many-sorted logic (this will amount to defining new universes i.e. new sorts), and in the second part of the paper we develop such a definability theory in one-sorted logic (where this will amount to enlarge the universe with newly defined elements). We will prove an analogon of Beth's definability theorem in this extended context, i.e. we will prove the coincidence of implicit and explicit definability, both in the many-sorted and in the one-sorted case.
Transfers between Logics and their Applications
Studia Logica - An International Journal for Symbolic Logic, 2002
In this paper, logics are conceived as two-sorted first-order structures, and we argue that this broad definition encompasses a wide class of logics with theoretical interest as well as interest from the point of view of applications. The language, concepts and methods of model theory can thus be used to describe the relationship between logics through morphisms of structures called transfers. This leads to a formal framework for studying several properties of abstract logics and their attributes such as consequence operator, syntactical structure, and internal transformations. In particular, we treat Belief Revision Systems (BRS) as our main example, defining the Wide Belief Revision Systems (WBRS's). This generalization allows us to define BRS's in an abstract setting for classical and non-standard logics. We also show how the concept of translation between logics can be obtained as a particular case of transfers.
Importing Logics: Soundness and Completeness Preservation
Studia Logica, 2013
Importing subsumes several asymmetric ways of combining logics, including modalization and temporalization. A calculus is provided for importing, inheriting the axioms and rules from the given logics and including additional rules for lifting derivations from the imported logic. The calculus is shown to be sound and concretely complete with respect to the semantics of importing as proposed in J. Rasga et al. (100(3):545-581, 2012) Studia Logica.