A Meta-Logical Framework for the Equivalence of Syntactic and Semantic Theories
Abstract
1. Introduction
1.1. The Standard/Received View of Theories
- A vocabulary of primitive terms, usually divided into logical, theoretical and observation terms.
- A set of sentences, which include correspondence rules.
- A set of axioms (primitive sentences or postulates).
- A set of rules of inference (to derive theorems or derivative sentences from the axioms).
1.2. Suppes’ Semantic Approach to Theories
1.3. Contemporary Treatment of the Syntactic/Semantic Theories Debate
2. The Formal Framework of Institutions: Presentation and Justification
- a collection of objects;
- a collection of arrows often called morphisms;
- operations assigning to each arrow an object , its domain, and an object , its codomain (we write to show that and ). The collection of all arrows with domain and codomain is written as ;
- a composition operator _ ∘_, assigning to each pair of arrows and with a composite arrow , satisfying the associative law:for any arrows , , and (with not necessarily distinct)
- 5.
- for each object A, an identity arrow satisfying the following identity law:
- a category having signatures as objects, and signature morphisms as arrows;
- a functor mapping each signature in to a class of -sentences;
- a functor assigning to each in a category whose objects are -models and whose morphisms are -model morphisms;17
- a relation for each , called -satisfaction, such that for each signature morphism , the satisfaction condition
- a category of signatures corresponding to the category Set of sets, such that each element is a signature and elements of are propositional variables;
- a functor , such that
- for each , is the least set that contains together with ‘’ and ‘’, and is closed under the propositional connectives;20
- for each function , translates propositional sentences containing propositional variables in to propositional sentences containing propositional variables in , without modifying the connectives in those sentences;
- a functor , such that
- for each , -models are functions of the form: . Given two -models and there is a morphism from to in case, for all , iff ;
- for each function , maps any model to the model ;
- for each , the satisfaction relation corresponds to the usual satisfaction relation in propositional logic.21
3. Syntactic and Semantic Theories over Institutions
3.1. The Liberal Syntactic View of Theories
- A syntactic Σ-theory presentation is a pair where is a signature and is a class of -sentences;
- A -model satisfies a syntactic theory presentation if satisfies each sentence in , in which case we write ;
- If is a class of -sentences, let be the class of all -models that satisfy each sentence in ;
- If is a class of -models, let be the class of all -sentences that are satisfied by each model in ; also denotes ;
- By the closure of a class of -sentences we mean the class , written ;
- A class of -sentences is closed if . Then a syntactic -theory is a theory presentation such that is closed;
- The syntactic theory presented by the syntactic presentation is .
3.2. The Liberal Semantic View of Theories
- A semantic -theory presentation is a pair where is a signature and M is a class of Σ-models.
- A -sentence is satisfied by a class M of Σ-models if is satisfied by each model in , in which case we write .
- If is a class of -models, let be the class of all -sentences that are satisfied by each model in .
- If is a class of -sentences, let be the class of all -models that satisfy each sentence in .
- A class of -models is closed if and only if . Then a semantic -theory is a semantic theory presentation such that is closed.
- The semantic theory presented by the semantic presentation is
3.3. Proving the Equivalence of the Two Approaches
- implies .
- implies .
- .
- .
- .
- .
- There is a dual (i.e., inclusion-reversing) isomorphism between the closed class of sentences and the closed class of models.
- .
- , for a signature morphism.
- Τ determines the semantic theory , consisting of all the -models that satisfy all the sentences in . (: Galois connection 5)
- determines the syntactic theory , consisting of those -sentences satisfied by all models in . (: Galois connection 6).
- , for every theory in .
- , for all morphisms and in .
4. Formalizing Suppes’ Account of Scientific Theories
“I define a Sign as anything which is so determined by something else, called its Object, and so determines an effect upon a person, which effect I call its Interpretant, that the latter is thereby mediately determined by the former.”[37], p. 478
5. Conclusions
Author Contributions
Funding
Institutional Review Board Statement
Informed Consent Statement
Data Availability Statement
Conflicts of Interest
1 | We share the view that this appellation is preferable to the more widely used “logical positivism”, but this is not the place to develop the point. |
2 | The term was coined by Putnam in a 1962 paper entitled What theories are not [5], which antedates Suppes’ paper. |
3 | Quantum mechanics, classical thermodynamics, and general relativity involve set theory and many results concerning the real numbers; it follows that their axiomatization in first-order logic is impractical because they assume more than first-order logic. |
4 | A well-defined sentence is a sentence assigned a unique interpretation, or value, regardless of the formalism used to express it. In second-order logic sentences are not well-defined because the concept of truth is non-absolute, that is, its meaning is dependent upon the used formalism; while in first-order logic it can be proven that “ ” is an absolute property of , and relative to ZFC, in second-order logic it is not [6]. |
5 | It should be emphasized here that Suppes’ [7] claim that the mathematical representations of matrix and wave mechanics are isomorphic is a quite debated one. For instance, Halvorson [8], discussed later in this paper, holds that matrix algebra is not isomorphic, and hence not equivalent, to a space of wave functions. |
6 | As Suppes points out, assessing the relation between these models is a problem of modern statistical methodology. |
7 | A theory’s mathematical models can be linked to models of data without explicit consideration of the more abstract models of the experiment. |
8 | A definitional extension of a language by a new predicate is a formula in the language of L extended with (), where is a vector of variables such that no other variables occur free in the formula, and is a well-formed formula of . |
9 | A definitional expansion by relation of a model of a theory with language expands with to form a structure for the language satisfying a definitional extension of by . |
10 | If the non-logical vocabularies are not disjoint, we can always re-express one of the two theories so that the respective vocabularies contain no common non-logical symbols. |
11 | Two theories have a common definitional extension if each has a definitional extension such that the two extended theories (now in the same language) are logically equivalent. |
12 | Dropping this claim has further consequences for structural realists who identify belief in a theory with believing that the world is isomorphic to one of its models; if equivalent syntactic theories have different classes of models, then there is no way of choosing which theory to believe in [15]. |
13 | For a formalization of the more general notion of a logic as an equivalence class of institutions based on an appropriate notion of equivalence see [24]. |
14 | By formalizing the idea that truth is invariant under change of notation, the satisfaction condition extends Tarski’s semantic definition of truth [25]; where Tarski defined truth for a given satisfaction relation, institutions extend this definition to a whole set of satisfaction relations, through the parametrization of truth by vocabulary [26]. |
15 | In fact, the name “institution” was inspired by the dominant status of first-order-logic, resembling –in terms of its stability– institutions like the Bank of England and the US Treasury. This name choice was meant to convey “an implicit criticism of the tendency to downplay the importance of developing and using specialized logics (i.e., in computer science) for specialized tasks” [26]. |
16 | The definition of a category in terms of set theory and the relevant examples given here are taken from [30]. |
17 | is the opposite category of category ; this means that has the same objects of , namey -models, and reversed morphisms, that is, the morphisms of but having opposite directions. This is why, in Figure 3 below, functor goes in the opposite direction of . |
18 | The figure is taken from [26]. |
19 | This formulation is taken from [33]. |
20 | This implies that, for any given signature , if it holds that , then also holds that ,, . |
21 | Given , and for any -model , the following holds: iff ; iff ; iff and iff or ; iff and . |
22 | A set of models M is called closed if and only if it consists of all models satisfying the set of sentences satisfied by each element of M. |
23 | is the inverse image map of → Mod(Σ). |
24 | Another criterion for isomorphic categories is the following: a functor yields an isomorphism if and only if it is bijective on objects and on morphism sets. Corollary 1 tells us that every object in Th determines an object in Vth and vice versa. But this in no way guarantees that each theory in Th is paired with exactly one theory in Vth and vice versa. |
25 | The signifying element refers to those parts of a sign which are mainly responsible for its function as a signifier. |
26 | The reader should refer to [39] for formal definitions and proofs. |
References
- Goguen, J.A.; Burstall, R.M. Abstract Model Theory for Specification and Programming. J. Assoc. Comput. Mach. 1992, 39, 95–146. [Google Scholar] [CrossRef]
- Hempel, C.G. The Theoretician’s Dilemma: A study in the Logic of Theory Construction. In Minnesota Studies in the Philosophy of Science, Volume 2: Concepts, Theories, and the Mind-Body Problem; Feigl, H., Scriven, M., Maxwell, G., Eds.; University of Minnesota Press: Minneapolis, MN, USA, 1958; pp. 37–98. [Google Scholar]
- Hempel, C.G. On the Standard Conception of Scientific Theories. In Minnesota Studies in the Philosophy of Science, Volume 4: Analyses of Theories and Methods of Physics and Psychology; Radner, M., Winokur, S., Eds.; University of Minnesota Press: Minneapolis, MN, USA, 1970; pp. 142–163. [Google Scholar]
- Suppes, P. What is a Scientific Theory? In Philosophy of Science Today; Morgenbesser, S., Ed.; Basic Books: New York, NY, USA, 1967; pp. 55–67. [Google Scholar]
- Putnam, H. What Theories Are Not. In Logic, Methodology and Philosophy of Science: Proceedings of the 1960 International Congress; Nagel, E., Suppes, P., Tarski, A., Eds.; Stanford University Press: Redwood City, CA, USA, 1962; pp. 240–251. [Google Scholar]
- Väänänen, J. Second-order and Higher-order Logic. In Stanford Encyclopedia of Philosophy; Stanford University: Stanford, CA, USA, 2019; Available online: https://plato.stanford.edu/entries/logic-higher-order/ (accessed on 18 June 2025).
- Suppes, P. The Desirability of Formalisation in Science. J. Philos. 1968, 64, 651–664. [Google Scholar] [CrossRef]
- Halvorson, H. What Theories Could Not Be. Philos. Sci. 2012, 79, 183–206. [Google Scholar] [CrossRef]
- Suppes, P. Models of Data. In Studies in Logic and the Foundations of Mathematics; Springer: Dordrecht, The Netherlands, 1966; Volume 44, pp. 252–261. [Google Scholar]
- Suppe, F. The Structure of Scientific Theories; University of Illinois Press: Champaign, IL, USA, 1977. [Google Scholar]
- Van Fraassen, B.C. Laws and Symmetry; Oxford University Press: Oxford, UK, 1989. [Google Scholar]
- Glymour, C. Theoretical Equivalence and the Semantic View of Theories. Philos. Sci. 2013, 80, 286–297. [Google Scholar] [CrossRef]
- de Bouvere, K. Synonymous Theories. In The Theory of Models, Proceedings of the 1963 International Symposium at Berkeley; Addison, J.W., Henkin, L., Tarski, A., Eds.; North-Holland Publishing Company: Amsterdam, The Netherlands, 1965; pp. 402–406. [Google Scholar]
- Lutz, S. What Was the Syntax-Semantics Debate in the Philosophy of Science About? Philos. Phenomenol. Res. 2017, 95, 319–352. [Google Scholar] [CrossRef]
- Halvorson, H. The Semantic View, if Plausible, is Syntactic. Philos. Sci. 2013, 80, 475–478. [Google Scholar] [CrossRef]
- Van Fraassen, B. One or Two Gentle Remarks about Hans Halvorson’s Critique of the Semantic View. Philos. Sci. 2014, 81, 276–283. [Google Scholar] [CrossRef]
- Van Fraassen, B.C. The Scientific Image; Oxford University Press: Oxford, UK, 1980. [Google Scholar]
- Van Fraassen, B.C. Scientific Representation: Paradoxes of Perspective; Oxford University Press: Oxford, UK, 2008. [Google Scholar]
- Hudetz, L. The Semantic View of Theories and Higher-Order Languages. Synthese 2019, 196, 1131–1149. [Google Scholar] [CrossRef]
- Worrall, J. An Unreal Image. Br. J. Philos. Sci. 1984, 35, 65–80. [Google Scholar] [CrossRef]
- Hendry, R.F.; Psillos, S. How to Do Things with Theories: An interactive view of language and models in science. In The Courage of Doing Philosophy: Essays Dedicated to Leszek Nowak; Brzeziński, A., Klawiter, A., Kuipers, T.A.F., Łastowski, K., Paprzycka, K., Przybysz, P., Eds.; Brill: Leiden, The Netherlands, 2007; pp. 59–115. [Google Scholar]
- Vos, B. Abstract Model Theory for Logical Meta-Science. Master’s Thesis, Utrecht University, Utrecht, The Netherlands, 2017. [Google Scholar]
- Goguen, J.A.; Burstall, R.M. Introducing Institutions. In Logic of Programs; Clarke, E., Kozen, D., Eds.; Springer: Berlin/Heidelberg, Germany, 1983; pp. 221–256, Logic of Programs 1983. Lecture Notes in Computer Science, 164. [Google Scholar]
- Mossakowski, T.; Goguen, J.; Diaconescu, R.; Tarlecki, A. What is a Logic? In Logica Universalis: Towards a General Theory of Logic; Birkhäuser: Basel, Switzerland, 2007; pp. 111–133. [Google Scholar]
- Tarski, A. The Semantic Conception of Truth: And the Foundations of Semantics. Philos. Phenomenol. Res. 1944, 4, 341–376. [Google Scholar] [CrossRef]
- Goguen, J.A. Information Integration in Institutions. In For Jon Barwise Memorial Volume; Moss, L., Ed.; Indiana University Press: Bloomington, IN, USA, 2006. [Google Scholar]
- Angius, N.; Dimarogkona, M.; Stefaneas, P. Building and Integrating Semantic Theories over Institutions. In Springer Proceedings in Mathematics and Statistics: Algebraic Modelling of Topological and Computational Structures and Applications; Lambropoulou, S., Theodorou, D., Stefaneas, P., Kauffman, L.H., Eds.; Springer: Berlin/Heidelberg, Germany, 2017; pp. 363–375. [Google Scholar]
- Dimarogkona, M.; Addis, M.; Stefaneas, P. Syntax, Semantics, and the Formalization of Social Science Theories. In Synthese Library 413: Scientific Discovery in the Social Sciences; Addis, M., Lane, P.C.R., Sozou, P.D., Gobet, F., Eds.; Springer: Berlin/Heidelberg, Germany, 2019; pp. 141–155. [Google Scholar]
- Scott, D.S. Relating theories of the λ-calculus. In To H.B. Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism; Seldin, J.P., Hindley, J.R., Eds.; Academic Press: Cambridge, MA, USA, 1980; pp. 403–450. [Google Scholar]
- Pierce, B.C. Basic Category Theory for Computer Scientists; MIT Press: Cambridge, MA, USA, 1991. [Google Scholar]
- Diaconescu, R. Institution-Independent Model Theory; Birkhuser Verlag AG: Berlin, Germany, 2008. [Google Scholar]
- Dimarogkona, M.; Stefaneas, P. Semantic Networks and the Theory of Institutions. Algebra Model Theory 2013, 9, 8–18. [Google Scholar]
- Sannella, D.; Tarlecki, A. Foundations of Algebraic Specification and Formal Software Development; Springer: Berlin/Heidelberg, Germany, 2012. [Google Scholar]
- Goguen, J.A.; Meseguer, J. Completeness of Many-sorted Equational Logic. SIGPLAN Notices 1981, 16, 24–32. [Google Scholar] [CrossRef]
- Lutz, S. Generalizing Empirical Adequacy 1: Multiplicity and Approximation. Synthese 2014, 191, 3195–3225. [Google Scholar] [CrossRef]
- Lawvere, F. William Adjointness in Foundations. Dialectica 1969, 23, 281–296. [Google Scholar] [CrossRef]
- Peirce, C.S. The Essential Peirce, Volume 2 (1893–1913); Indiana University Press: Bloomington, IN, USA, 1998. [Google Scholar]
- Balzer, W.; Moulines, C.U.; Sneed, J.D. An Architectonic for Science: The Structuralist Program; Reidel: Dordrecht, The Netherlands, 1987. [Google Scholar]
- Lutz, S. What’s right with a syntactic approach to theories and models? Erkenntnis 2014, 79, 1475–1492. [Google Scholar] [CrossRef]
- Kutz, O.; Mossakowski, T.; Lücke, D. Carnap, Goguen, and the Hyperontologies: Logical Pluralism and Heterogeneous Structuring in Ontology Design. Log. Universalis 2010, 4, 255–333. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
Share and Cite
Dimarogkona, M.; Stefaneas, P.; Angius, N. A Meta-Logical Framework for the Equivalence of Syntactic and Semantic Theories. Philosophies 2025, 10, 78. https://doi.org/10.3390/philosophies10040078
Dimarogkona M, Stefaneas P, Angius N. A Meta-Logical Framework for the Equivalence of Syntactic and Semantic Theories. Philosophies. 2025; 10(4):78. https://doi.org/10.3390/philosophies10040078
Chicago/Turabian StyleDimarogkona, Maria, Petros Stefaneas, and Nicola Angius. 2025. "A Meta-Logical Framework for the Equivalence of Syntactic and Semantic Theories" Philosophies 10, no. 4: 78. https://doi.org/10.3390/philosophies10040078
APA StyleDimarogkona, M., Stefaneas, P., & Angius, N. (2025). A Meta-Logical Framework for the Equivalence of Syntactic and Semantic Theories. Philosophies, 10(4), 78. https://doi.org/10.3390/philosophies10040078