Second-Order Logic

Using recent results in topos theory, two systems of higher-order logic are shown to be complete with respect to sheaf models over topological spaces- so -called "topological semantics." The first is classical higher-order logic, with relational quantification of finitely high type; the second system is a predicative fragment thereof with quantification over functions between types, but not over arbitrary relations. The second theorem applies to intuitionistic as well as classical logic.

We prove, among other things, that the number mentioned above cannot be shown to exist without using some $\Pi_1(\mathscr{P})$ instance of the axiom of replacement.

This paper examines the ontological commitments of the second-order language of arithmetic and argues that they do not extend beyond the first-order language. Then, building on an argument by George Boolos, we develop a Tarski-style definition of a truth predicate for the second-order language of arithmetic that does not involve the assignment of sets to second-order variables but rather uses the same class of assignments standardly used in a definition for the first-order language.

Second-order logic has a number of attractive features, in particular the strong expressive resources it offers, and the possibility of articulating categorical mathematical theories (such as arithmetic and analysis). But it also has its costs. Five major charges have been launched against second-order logic: (1) It is not axiomatizable; as opposed to first-order logic, it is inherently incomplete. (2) It also has several semantics, and there is no criterion to choose between them (Putnam, J Symbol Logic 45:464–482, 1980 ). Therefore, (...) it is not clear how this logic should be interpreted. (3) Second-order logic also has strong ontological commitments: (a) it is ontologically committed to classes (Resnik, J Phil 85:75–87, 1988 ), and (b) according to Quine (Philosophy of logic, Prentice-Hall: Englewood Cliffs, 1970 ), it is nothing more than “set theory in sheep’s clothing”. (4) It is also not better than its first-order counterpart, in the following sense: if first-order logic does not characterize adequately mathematical systems, given the existence of non - isomorphic first-order interpretations, second-order logic does not characterize them either, given the existence of different interpretations of second-order theories (Melia, Analysis 55:127–134, 1995 ). (5) Finally, as opposed to what is claimed by defenders of second-order logic [such as Shapiro (J Symbol Logic 50:714–742, 1985 )], this logic does not solve the problem of referential access to mathematical objects (Azzouni, Metaphysical myths, mathematical practice: the logic and epistemology of the exact sciences, Cambridge University Press, Cambridge, 1994 ). In this paper, I argue that the second-order theorist can solve each of these difficulties. As a result, second-order logic provides the benefits of a rich framework without the associated costs. (shrink)

In this paper, I shall provide a defence of second-order logic in the context of its use in the philosophy of mathematics. This shall be done by considering three problems that have been recently posed against this logic: (1) According to Resnik [1988], by adopting second-order quantifiers, we become ontologically committed to classes. (2) As opposed to what is claimed by defenders of second-order logic (such as Shapiro [1985]), the existence of non-standard models of first-order theories does not establish the (...) inadequacy of first—order axiomatisations (Melia [1995]). (3) In contrast with Shapiro’s suggestion (in his [1985]), second-order logic does not help us to establish referential access to mathematical objects (Azzouni [1994]). As I shall argue, each of these problems can be neatly solved by the second-order theorist. As a result, a case for second-order logic can be made. The first two problems will beconsidered rather briefly in the next section. The rest of the paper is dedicate to a discussion of the third. (shrink)

This article surveys recent literature by Parsons, McGee, Shapiro and others on the significance of categoricity arguments in the philosophy of mathematics. After discussing whether categoricity arguments are sufficient to secure reference to mathematical structures up to isomorphism, we assess what exactly is achieved by recent ‘internal’ renditions of the famous categoricity arguments for arithmetic and set theory.

Some internal and philosophical remarks are made regarding a system of a second order logic of existence axiomatized by the author. Attributes are distinguished in the system according as their possession entails existence or not, The former being called e-Attributes. Some discussion of the special principles assumed for e-Attributes is given as well as of the two notions of identity resulting from such a distinction among attributes. Non-Existing objects are of course indiscernible in terms of e-Attributes. In addition, However, Existing (...) objects indiscernible in terms of e-Attributes are indiscernible in terms of all attributes. (shrink)

“Second-order Logic” in Anderson, C.A. and Zeleny, M., Eds. Logic, Meaning, and Computation: Essays in Memory of Alonzo Church. Dordrecht: Kluwer, 2001. Pp. 61–76. -/- Abstract. This expository article focuses on the fundamental differences between second- order logic and first-order logic. It is written entirely in ordinary English without logical symbols. It employs second-order propositions and second-order reasoning in a natural way to illustrate the fact that second-order logic is actually a familiar part of our traditional intuitive logical framework and (...) that it is not an artificial formalism created by specialists for technical purposes. To illustrate some of the main relationships between second-order logic and first-order logic, this paper introduces basic logic, a kind of zero-order logic, which is more rudimentary than first-order and which is transcended by first-order in the same way that first-order is transcended by second-order. The heuristic effectiveness and the historical importance of second-order logic are reviewed in the context of the contemporary debate over the legitimacy of second-order logic. Rejection of second-order logic is viewed as radical: an incipient paradigm shift involving radical repudiation of a part of our scientific tradition, a tradition that is defended by classical logicians. But it is also viewed as reactionary: as being analogous to the reactionary repudiation of symbolic logic by supporters of “Aristotelian” traditional logic. But even if “genuine” logic comes to be regarded as excluding second-order reasoning, which seems less likely today than fifty years ago, its effectiveness as a heuristic instrument will remain and its importance for understanding the history of logic and mathematics will not be diminished. Second-order logic may someday be gone, but it will never be forgotten. Technical formalisms have been avoided entirely in an effort to reach a wide audience, but every effort has been made to limit the inevitable sacrifice of rigor. People who do not know second-order logic cannot understand the modern debate over its legitimacy and they are cut-off from the heuristic advantages of second-order logic. And, what may be worse, they are cut-off from an understanding of the history of logic and thus are constrained to have distorted views of the nature of the subject. As Aristotle first said, we do not understand a discipline until we have seen its development. It is a truism that a person's conceptions of what a discipline is and of what it can become are predicated on their conception of what it has been. (shrink)

Corcoran’s 27 entries in the 1999 second edition of Robert Audi’s Cambridge Dictionary of Philosophy [Cambridge: Cambridge UP]. -/- ancestral, axiomatic method, borderline case, categoricity, Church (Alonzo), conditional, convention T, converse (outer and inner), corresponding conditional, degenerate case, domain, De Morgan, ellipsis, laws of thought, limiting case, logical form, logical subject, material adequacy, mathematical analysis, omega, proof by recursion, recursive function theory, scheme, scope, Tarski (Alfred), tautology, universe of discourse. -/- The entire work is available online free at more than (...) one website. Paste the whole URL. http://archive.org/stream/RobertiAudi_The.Cambridge.Dictionary.of.Philosophy/Robert.Audi_The.Cambrid ge.Dictionary.of.Philosophy -/- The 2015 third edition will be available soon. Before you think of buying it read some reviews on Amazon and read reviews of its competition: For example, my review of the 2008 Oxford Companion to Philosophy, History and Philosophy of Logic,29:3,291-292. URL: http://dx.doi.org/10.1080/01445340701300429 -/- Some of the entries have already been found to be flawed. For example, Tarski’s expression ‘materially adequate’ was misinterpreted in at least one article and it was misused in another where ‘materially correct’ should have been used. The discussion provides an opportunity to bring more flaws to light. -/- Acknowledgements: Each of these entries was presented at meetings of The Buffalo Logic Dictionary Project sponsored by The Buffalo Logic Colloquium. The members of the colloquium read drafts before the meetings and were generous with corrections, objections, and suggestions. Usually one 90-minute meeting was devoted to one entry although in some cases, for example, “axiomatic method”, took more than one meeting. Moreover, about half of the entries are rewrites of similarly named entries in the 1995 first edition. Besides the help received from people in Buffalo, help from elsewhere was received by email. We gratefully acknowledge the following: José Miguel Sagüillo, John Zeis, Stewart Shapiro, Davis Plache, Joseph Ernst, Richard Hull, Concha Martinez, Laura Arcila, James Gasser, Barry Smith, Randall Dipert, Stanley Ziewacz, Gerald Rising, Leonard Jacuzzo, George Boger, William Demopolous, David Hitchcock, John Dawson, Daniel Halpern, William Lawvere, John Kearns, Ky Herreid, Nicolas Goodman, William Parry, Charles Lambros, Harvey Friedman, George Weaver, Hughes Leblanc, James Munz, Herbert Bohnert, Robert Tragesser, David Levin, Sriram Nambiar, and others. -/- . (shrink)

For each positive n , two alternative axiomatizations of the theory of strings over n alphabetic characters are presented. One class of axiomatizations derives from Tarski's system of the Wahrheitsbegriff and uses the n characters and concatenation as primitives. The other class involves using n character-prefixing operators as primitives and derives from Hermes' Semiotik. All underlying logics are second order. It is shown that, for each n, the two theories are definitionally equivalent [or synonymous in the sense of deBouvere]. It (...) is further shown that each member of one class is synonymous with each member of the other class; thus that all of the theories are definitionally equivalent with each other and with Peano arithmetic. Categoricity of Peano arithmetic then implies categoricity of each of the above theories. (shrink)

It was conjectured by Halpern and Kapron (Annals of Pure and Applied Logic, vol. 69, 1994) that frame satisfiability of propositional modal formulas is incomparable in expressive power to both Σ 1 1 (Ackermann) and Σ 1 1 (Bernays-Schonfinkel). We prove this conjecture. Our results imply that Σ 1 1 (Ackermann) and Σ 1 1 (Bernays-Schonfinkel) are incomparable in expressive power, already on finite graphs. Moreover, we show that on ordered finite graphs, i.e., finite graphs with a successor, Σ 1 (...) 1 (Bernays-Schonfinkel) is strictly more expressive than Σ 1 1 (Ackermann). (shrink)

We show that the spectrum of a sentence ϕ in Counting Monadic Second Order Logic (CMSOL) using one binary relation symbol and finitely many unary relation symbols, is ultimately periodic, provided all the models of ϕ are of clique width at most k, for some fixed k. We prove a similar statement for arbitrary finite relational vocabularies τ and a variant of clique width for τ-structures. This includes the cases where the models of ϕ are of tree width at most (...) k. For the case of bounded tree-width, the ultimate periodicity is even proved for Guarded Second Order Logic GSOL. We also generalize this result to many-sorted spectra, which can be viewed as an analogue of Parikh's Theorem on context-free languages, and its analogues for context-free graph grammars due to Habel and Courcelle. Our work was inspired by Gurevich and Shelah (2003), who showed ultimate periodicity of the spectrum for sentences of Monadic Second Order Logic where only finitely many unary predicates and one unary function are allowed. This restriction implies that the models are all of tree width at most 2, and hence it follows from our result. (shrink)

The paradox that appears under Burali-Forti’s name in many textbooks of set theory is a clever piece of reasoning leading to an unproblematic theorem. The theorem asserts that the ordinals do not form a set. For such a set would be—absurdly—an ordinal greater than any ordinal in the set of all ordinals. In this article, we argue that the paradox of Burali-Forti is first and foremost a problem about concept formation by abstraction, not about sets. We contend, furthermore, that some (...) hundred years after its discovery the paradox is still without any fully satisfactory resolution. A survey of the current literature reveals one key assumption of the paradox that has gone unquestioned, namely the assumption that ordinals are objects. Taking the lead from Russell’s no class theory, we interpret talk of ordinals as an efficient way of conveying higher-order logical truths. The resulting theory of ordinals is formally adequate to standard intuitions about ordinals, expresses a conception of ordinal number capable of resolving Burali-Forti’s paradox, and offers a novel contribution to the longstanding program of reducing mathematics to higher-order logic. (shrink)

Second-order quantifier elimination in the context of classical logic emerged as a powerful technique in many applications, including the correspondence theory, relational databases, deductive and knowledge databases, knowledge representation, commonsense reasoning and approximate reasoning. In the current paper we first generalize the result of Nonnengart and Szałas [17] by allowing second-order variables to appear within higher-order contexts. Then we focus on a semantical analysis of conditionals, using the introduced technique and Gabbay’s semantics provided in [10] and substantially using a third-order (...) accessibility relation. The analysis is done via finding correspondences between axioms involving conditionals and properties of the underlying third-order relation. (shrink)

It is known that various complexity-theoretical problems can be translated into some special spectra problems. Thus, questions about complexity classes are translated into questions about the expressive power of some languages. In this paper we investigate the spectra of some logics with Henkin quantifiers in the empty vocabulary.

Under a weak set-theoretic assumption we interpret second-order logic in the monadic theory of order.

Some widely accepted arguments in the philosophy of mathematics are fallacious because they rest on results that are provable only by using assumptions that the con- clusions of these arguments seek to undercut. These results take the form of bicon- ditionals linking statements of logic with statements of mathematics. George Boolos has given an argument of this kind in support of the claim that certain facts about second-order logic support logicism, the view that mathematics—or at least part of it—reduces to (...) logic. Hilary Putnam has offered a similar argument for the view that it is indifferent whether we take mathematics to be about objects or about what follows from certain postulates. In this paper I present and rebut these arguments. (shrink)

It has been known for a few years that no more than Pi-1-1 comprehension is needed for the proof of "Frege's Theorem". One can at least imagine a view that would regard Pi-1-1 comprehension axioms as logical truths but deny that status to any that are more complex—a view that would, in particular, deny that full second-order logic deserves the name. Such a view would serve the purposes of neo-logicists. It is, in fact, no part of my view that, say, (...) Delta-3-1 comprehension axioms are not logical truths. What I am going to suggest, however, is that there is a special case to be made on behalf of Pi-1-1 comprehension. Making the case involves investigating extensions of first-order logic that do not rely upon the presence of second-order quantifiers. A formal system for so-called "ancestral logic" is developed, and it is then extended to yield what I call "Arché logic". (shrink)

Hintikka and Sandu had argued that 'Frege's failure to grasp the idea of the standard interpretation of higher-order logic turns his entire foundational project into a hopeless daydream' and that he is 'inextricably committed to a non-standard interpretation' of higher-order logic. We disagree.

There has been very little discussion of the appropriate principles to govern a modal logic of plurals. What debate there has been has accepted a principle I call (Necinc); informally if this is one of those then, necessarily: this is one of those. On this basis Williamson has criticised the Boolosian plural interpretation of monadic second-order logic. I argue against (Necinc), noting that it isn't a theorem of any logic resulting from adding modal axioms to the plural logic PFO+, and (...) showing that the most obvious formal argument in its favour is question begging. I go on to discuss the behaviour of natural language plurals, motivating a case against (Necinc) by developing a case that natural language plural terms are not de jure rigid designators. The paper concludes by developing a model theory for modal PFO-f which does not validate (Necinc). An Appendix discusses (Necinc) in relation to counterpart theory. Of course, it would be a mistake to think that the rules for "multiple pointing" follow automatically from the rules for pointing proper. Max Black—The Elusiveness of Sets In some influential articles during the 1980s George Boolos proposed an interpretation of monadic second-order logic in terms of plural quantification [4, 5]. One objection to this proposal, pressed by Williamson [22, 456-7], focuses on the modal behaviour of plural variables, arguing that the proposed interpretation yields the wrong results in respect of the modal status of atomic predications. In the present paper I will present this objection and argue against it. In the course of developing the argument, I will have cause to consider the under-investigated question of how a logic for plurals should be extended to incorporate modal operators. (shrink)

Because of its capacity to characterize mathematical concepts and structures?a capacity which first-order languages clearly lack?second-order languages recommend themselves as a convenient framework for much of mathematics, including set theory. This paper is about the credentials of second-order logic:the reasons for it to be considered logic, its relations with set theory, and especially the efficacy with which it performs its role of the underlying logic of set theory.

This paper studies the expressive power that an extra first order quantifier adds to a fragment of monadic second order logic, extending the toolkit of Janin and Marcinkowski [JM01]. We introduce an operation $esists_{n}(S)$ on properties S that says "there are n components having S". We use this operation to show that under natural strictness conditions, adding a first order quantifier word u to the beginning of a prefix class V increases the expressive power monotonically in u. As a corollary, (...) if the first order quantifiers are not already absorbed in V, then both the quantifier alternation hierarchy and the existential quantifier hierarchy in the positive first order closure of V are strict. We generalize and simplify methods from Marcinkowski [Mar99] to uncover limitations of the expressive power of an additional first order quantifier, and show that for a wide class of properties S, S cannot belong to the positive first order closure of a monadic prefix class W unless it already belongs to W. We introduce another operation alt(S) on properties which has the same relationship with the Circuit Value Problem as reach(S) (defined in [JM01]) has with the Directed Reachability Problem. We use alt(S) to show that $\prod_{n}\nsubseteq FO(\Sigma_{n})$ , $\Sigma_{n} \nsubseteq FO(\delta_{n})$ , and $\delta_{n+1} \nsubseteq FOB(\Sigma_{n})$ , solving some open problems raised in [Mat98]. (shrink)

In recent years large amounts of electronic texts have become available. While the first of these corpora had only a low level of annotation, the more recent ones are annotated with refined syntactic information. To make these rich annotations accessible for linguists, the development of query systems has become an important goal. One of the main difficulties in this task consists in the choice of the right query language, a language which at the same time should be powerful enough to (...) let users formulate the queries they want and which should be efficiently evaluable to keep query response times short. There is a widespread belief that such a query language does not exist. It is therefore the aim of this paper to show that there is indeed a powerful query language that can be efficiently evaluated. We propose the use of monadic second-order logic as a query language. We show that a query in this language can be evaluated in linear time in the size of a tree in the corpus. We also provide examples of complicated linguistic queries expressed in monadic second-order logic thereby demonstrating the high expressive power of the language. (shrink)

Second-order logic is the extension of first-order logic obtaining by introducing quantification of predicate and function variables.

We propose an original use of techniques from random graph theory to find a Monadic ∑ 1 1 sentence without an asymptotic probability. Our result implies that the 0-1 law fails for the logics ∑ 1 1 and ∑ 1 1 . Therefore we complete the classification of first-order prefix classes with or without equality, according to the existence of the 0-1 law for the corresponding ∑ 1 1 fragment. In addition, our counterexample can be viewed as a single explanation (...) of the failure of the 0-1 law of all the fragments of existential second-order logic for which the failure is already known. (shrink)

Consider one of several things. Is the one thing necessarily one of the several? This key question in the modal logic of plurals is clarified. Some defenses of an affirmative answer are developed and compared. Various remarks are made about the broader philosophical significance of the question.

Ordinary English contains different forms of quantification over objects. In addition to the usual singular quantification, as in 'There is an apple on the table', there is plural quantification, as in 'There are some apples on the table'. Ever since Frege, formal logic has favored the two singular quantifiers ∀x and ∃x over their plural counterparts ∀xx and ∃xx (to be read as for any things xx and there are some things xx). But in recent decades it has been argued (...) that we have good reason to admit among our primitive logical notions also the plural quantifiers ∀xx and ∃xx. More controversially, it has been argued that the resulting formal system with plural as well as singular quantification qualifies as ‘pure logic’; in particular, that it is universally applicable, ontologically innocent, and perfectly well understood. In addition to being interesting in its own right, this thesis will, if correct, make plural quantification available as an innocent but extremely powerful tool in metaphysics, philosophy of mathematics, and philosophical logic. For instance, George Boolos has used plural quantification to interpret monadic second-order logic and has argued on this basis that monadic second-order logic qualifies as “pure logic.” Plural quantification has also been used in attempts to defend logicist ideas, to account for set theory, and to eliminate ontological commitments to mathematical objects and complex objects. (shrink)

John Burgess in a 2004 paper combined plural logic and a new version of the idea of limitation of size to give an elegant motivation of the axioms of ZFC set theory. His proposal is meant to improve on earlier work by Paul Bernays in two ways. I argue that both attempted improvements fail. I am grateful to Philip Welch, two anonymous referees, and especially Ignacio Jané for written comments on earlier versions of this paper, which have led to substantial (...) improvements. Thanks also to the participants in a discussion group at the University of Bristol, where an earlier version was presented. (shrink)

This paper criticizes George Boolos's famous use of plural quantification to argue that monadic second-order logic is pure logic. I deny that plural quantification qualifies as pure logic and express serious misgivings about its alleged ontological innocence. My argument is based on an examination of what is involved in our understanding of the impredicative plural comprehension schema.

Thus far the logic out of which mathematics has developed has been First-order Predicate Calculus with Identity, that is the logic of the sentential functors, ¬, →, ∧, ∨, etc., together with identity and the existential and universal quotifiers restricted to quotify- ing only over individuals, and not anything else, such as qualities or quotities themselves. Some philosophers—among them Quine— have held that this, First-order Logic, as it is often called, con- stitutes the whole of logic. But that is a (...) mistake. It leaves out Second-order Logic, which we need if we are to characterize the natural numbers precisely, and pays scant attention to the logic of relations, especially transitive relations, which is the key to much of modern mathematics. Quine’s argument for restricting logic to First-order Logice was based on the grounds that only First- order logical theories display “Law and Order” and himself regards modal logic as belonging with witchcraft and superstition.1 Pred- icates are ontologically more suspect than individuals, and have a different logic, which is liable to give rise to paradox and inconsis- tency. Moreover, Second-order Logic lacks the completeness that First-order Logice has, which provides a pleasing parallel between syntactic and semantic notions, and argues for the analyticity of deductive logic. (shrink)

According to the species of neo-logicism advanced by Hale and Wright, mathematical knowledge is essentially logical knowledge. Their view is found to be best understood as a set of related though independent theses: (1) neo-fregeanism-a general conception of the relation between language and reality; (2) the method of abstraction-a particular method for introducing concepts into language; (3) the scope of logic-second-order logic is logic. The criticisms of Boolos, Dummett, Field and Quine (amongst others) of these theses are explicated and assessed. (...) The issues discussed include reductionism, rejectionism, the Julius Caesar problem, the Bad Company objections, and the charge that second-order logic is set theory in disguise. (shrink)

It is common for contemporary metaphysical realists to adopt Quine's criterion of ontological commitment while at the same time repudiating his ontological pragmatism. 2 Drawing heavily from the work of others—especially Joseph Melia and Stephen Yablo—I will argue that the resulting approach to meta-ontology is unstable. In particular, if we are metaphysical realists, we need not accept ontological commitment to whatever is quantified over by our best first-order theories.

Classical logic has proved inadequate in various areas of computer science, artificial intelligence, mathematics, philosopy and linguistics. This is an introduction to extensions of first-order logic, based on the principle that many-sorted logic (MSL) provides a unifying framework in which to place, for example, second-order logic, type theory, modal and dynamic logics and MSL itself. The aim is two fold: only one theorem-prover is needed; proofs of the metaproperties of the different existing calculi can be avoided by borrowing them from (...) MSL. To make the book accessible to readers from different disciplines, whilst maintaining precision, the author has supplied detailed step-by-step proofs, avoiding difficult arguments, and continually motivating the material with examples. Consequently this can be used as a reference, for self-teaching or for first-year graduate courses. (shrink)

Bob Hale’s distinguished record of research places him among the most important and influential contemporary analytic metaphysicians. In his deep, wide ranging, yet highly readable book Necessary Beings, Hale draws upon, but substantially integrates and extends, a good deal his past research to produce a sustained and richly textured essay on — as promised in the subtitle — ontology, modality, and the relations between them. I’ve set myself two tasks in this review: first, to provide a reasonably thorough (if not (...) exactly comprehensive) overview of the structure and content of Hale’s book and, second, to a limited extent, to engage Hale’s book philosophically. I approach these tasks more or less sequentially: Parts I and 2 of the review are primarily expository; in Part 3 I adopt a somewhat more critical stance and raise several issues concerning one of the central elements of Hale’s account, his essentialist theory of modality. (shrink)

Standard (classical) logic is not independent of set theory. Which formulas are valid in logic depends on which sets we assume to exist in our set-theoretical universe. Second-order logic is just set theory in disguise. The typically logical notions of validity and consequence are not well defined in second-order logic, at least as long as there are open issues in set theory. Such contentious issues in set theory as the axiom of choice, the continuum hypothesis or the existence of inaccessible (...) cardinals, can be equivalently transformed into question about the logical validity of pure sentences of second-order logic, where “pure” means that they only contain logical symbols and bound variables. Even standard first-order logic depends on the acceptance on infinite sets in our set-theoretical universe. Should we choose to admit only finite sets, the number of logically valid pure first-order formulas would increase dramatically and first-order logic would not be recursively enumerable any longer. (shrink)

Pure second-order logic is second-order logic without functional or first-order variables. In "Pure Second-Order Logic," Denyer shows that pure second-order logic is compact and that its notion of logical truth is decidable. However, his argument does not extend to pure second-order logic with second-order identity. We give a more general argument, based on elimination of quantifiers, which shows that any formula of pure second-order logic with second-order identity is equivalent to a member of a circumscribed class of formulas. As a (...) corollary, pure second-order logic with second-order identity is compact, its notion of logical truth is decidable, and it satisfies a pure second-order analogue of model completeness. We end by mentioning an extension to n th-order pure logics. (shrink)