This paper investigates whether there is an acceptable version of Functionalism that avoids commitment to second-order properties. I argue that the answer is "no". I consider two reductionist versions of Functionalism, and argue that both are compatible with multiple realization as such. There is a more specific type of multiple realization that poses difficulties for these views, however. The only apparent Functionalist solution is to accept second-order properties.

Abstract: In this paper, I examine the current case against the second-order property view of existence through a discussion of Colin McGinn's up to date statement of this case. I conclude that the second-order property view of existence remains viable.

We defend Jaegwon Kim’s ‘causal inheritance’ principle from an objection raised by Jurgen Schröder. The objection is that the principle is inconsistent with a view about mental properties assumed by Kim, namely, that they are second-order properties. We argue that Schröder misconstrues the notion of second-order property. We distinguish three notions of second-order property and highlight their problems and virtues. Finally, we examine the consequence of Kim’s principle and discuss the issue of (...) whether Kim’s ‘supervenience argument’ generalizes to all special sciences or not. (shrink)

Shelah, S., C. Laflamme and B. Hart, Models with second order properties V: A general principle, Annals of Pure and Applied Logic 64 169–194. We present a general framework for carrying out the construction in [2-10] and others of the same type. The unifying factor is a combinatorial principle which we present in terms of a game in which the first player challenges the second player to carry out constructions which would be much easier in a generic (...) extension of the universe, and the second player cheats with the aid of ♦. Section 1 contains an axiomatic framework suitable for the description of a number of related constructions, and the statement of the main theorem 1.9 in terms of this framework. In Section 2 we illustrate the use of our combinatorial principle. The proof of the main result is then carried out in Sections 3–5. (shrink)

Quine’s most important charge against second-, and more generally, higher-order logic is that it carries massive existential commitments. The force of this charge does not depend upon Quine’s questionable assimilation of second-order logic to set theory. Even if we take second-order variables to range over properties, rather than sets, the charge remains in force, as long as properties are individuated purely extensionally. I argue that if we interpret them as ranging over properties more reasonably (...) construed, in accordance with an abundant or deflationary conception, Quine’s charge can be resisted. This interpretation need not be seen as precluding the use of model-theoretic semantics for second-order languages; but it will preclude the use of the standard semantics, along with the more general Henkin semantics, of which it is a special case. To that extent, the approach I recommend has revisionary implications which some may find unpalatable; it is, however, compatible with the quite different special case in which the second-order variables are taken to range over definable subsets of the first-order domain, and with respect to such a semantics, some important metalogical results obtainable under the standard semantics may still be obtained. In my final section, I discuss the relations between second-order logic, interpreted as I recommend, and a strong version of schematic ancestral logic promoted in recent work by Richard Heck. I argue that while there is an interpretation on which Heck’s logic can be contrasted with second-order logic as standardly interpreted, when it is so interpreted, its differences from the more modest form of second-order logic I advocate are much less substantial, and may be largely presentational. (shrink)

The paper sets forth an argument against Kim's distinction between levels and orders.

Let L(Q) be first order logic with Keisler's quantifier, in the λ + interpretation (= the satisfaction is defined as follows: $M \models (\mathbf{Q}x)\varphi(x)$ means there are λ + many elements in M satisfying the formula φ(x)). Theorem 1. Let λ be a singular cardinal; assume □ λ and GCH. If T is a complete theory in L(Q) of cardinality at most λ, and p is an L(Q) 1-type so that T strongly omits $p (= p$ has no support, (...) to be defined in $\S1$ ), then T has a model of cardinality λ + in the λ + interpretation which omits p. Theorem 2. Let λ be a singular cardinal, and let T be a complete first order theory of cardinality λ at most. Assume □ λ and GCH. If Γ is a smallness notion then T has a model of cardinality λ + such that a formula φ(x) is realized by λ + elements of M iff φ(x) is not Γ-small. The theorem is proved also when λ is regular assuming $\lambda = \lambda^{ . It is new when λ is singular or when |T| = λ is regular. Theorem 3. Let λ be singular. If $\operatorname{Con}(ZFC + GCH + (\exists\kappa)$ [κ is a strongly compact cardinal]), then the following in consistent: ZFC + GCH + the conclusions of all above theorems are false. (shrink)

Problems about the accidental properties of properties motivate us--force us, I think--not to identify properties with the sets of their instances. If we identify them instead with functions from worlds to extensions, we get a theory of properties that is neutral with respect to disputes over counterpart theory, and we avoid a problem for Lewis's theory of events. Similar problems about the temporary properties of properties motivate us--though this time they probably don't force us--to give up this theory as well, (...) and to identify properties with functions from ⟨world, time⟩ pairs to extensions. Again, the replacement theory is neutral with respect to a metaphysical dispute that the old theory (arguably) forces us to take a stand on--the dispute over whether objects have temporal parts. It also allows us to give a smoother semantics for predication, to better accommodate our intuitions about which objects temporary properties are properties of, and to make temporally self-locating beliefs genuinely self -locating. (shrink)

Problems about the accidental properties of properties motivate us--force us, I think--not to identify properties with the sets of their instances. If we identify them instead with functions from worlds to extensions, we get a theory of properties that is neutral with respect to disputes over counterpart theory, and we avoid a problem for Lewis's theory of events. Similar problems about the temporary properties of properties motivate us--though this time they probably don't force us--to give up this theory as well, (...) and to identify properties with functions from world, time pairs to extensions. Again, the replacement theory is neutral with respect to a metaphysical dispute that the old theory (arguably) forces us to take a stand on--the dispute over whether objects have temporal parts. It also allows us to give a smoother semantics for predication, to better accommodate our intuitions about which objects temporary properties are properties of, and to make temporally self-locating beliefs genuinely self -locating. (shrink)

Egan argues against Lewis’s view that properties are sets of actual and possible individuals and in favour of the view that they are functions from worlds to extensions (sets of individuals). Egan argues that Lewis’s view implies that 2nd order properties are never possessed contingently by their (1st order) bearers, an implication to which there are numerous counter-examples. And Egan argues that his account of properties is more commensurable with the role they play as the semantic values of (...) predicates than is Lewis’s. (shrink)

We prove that every monadic second-order property of the unfolding of a transition system is a monadic second-order property of the system itself. An unfolding is an instance of the general notion of graph covering. We consider two more instances of this notion. A similar result is possible for one of them but not for the other.

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)

Comments on Andy Egan’s "Second-Order Predication and the Metaphysics of Properties," presented at California State University Long Beach, CA 2003.

This is an introductory paper to a series of results linking generic absoluteness results for second and third order number theory to the model theoretic notion of model companionship. Specifically we develop here a general framework linking Woodin’s generic absoluteness results for second order number theory and the theory of universally Baire sets to model companionship and show that (with the required care in details) a $$\Pi _2$$ -property formalized in an appropriate language for (...) class='Hi'>second order number theory is forcible from some $$T\supseteq \mathsf {ZFC}+$$ large cardinals if and only if it is consistent with the universal fragment of T if and only if it is realized in the model companion of T. In particular we show that the first order theory of $$H_{\omega _1}$$ is the model companion of the first order theory of the universe of sets assuming the existence of class many Woodin cardinals, and working in a signature with predicates for $$\Delta _0$$ -properties and for all universally Baire sets of reals. We will extend these results also to the theory of $$H_{\aleph _2}$$ in a follow up of this paper. (shrink)

Among philosophers of mind, it is common to assume that at least some mental properties are functional in nature, and that functional properties are second-order properties. In the functionalist literature, the notion of being a second-order property is cashed out in three different ways: (i) in terms of semantic features of characterizations or definitions of properties, (ii) in terms of syntactic features of second-order quantification, and (iii) in terms of a metaphysical criterion, according (...) to which properties are second order if they are properties of first-order properties. It is shown that in the context of functionalism reference to these interpretations is misguided, and it is suggested that the notion of an ordering of properties in this context is best understood as being tied to dependence-relations. (shrink)

The paper characterizes the second order arithmetic theorems of a set theory that features a recursively Mahlo universe; thereby complementing prior proof-theoretic investigations on this notion. It is shown that the property of being recursively Mahlo corresponds to a certain kind of β-model reflection in second order arithmetic. Further, this leads to a characterization of the reals recursively computable in the superjump functional.

Resumen En una serie de escritos Timothy Williamson ha argumentado a favor del necesitismo, esto es, la tesis de que es necesario que todo exista necesariamente. Este trabajo discute el necesitismo de segundo orden, esto es, la tesis de que es necesario que toda propiedad exista necesariamente, considerando líneas de argumentación semejantes a las desplegadas en primer orden. Se examinan tres de estos argumentos: el carácter necesario de ser una propiedad, la aparición de las propiedades en proposiciones, y los compromisos (...) ontológicos del metalenguaje en el que se formula la semántica. Se argumenta que ninguno de ellos es realmente convincente. La justificación del necesitismo de segundo orden parece requerir más metafísica sustantiva que resultados formales, al menos si es que los resultados formales de que se trata son aquellos discutidos aquí.In a series of writings Timothy Williamson has argued for necessitism, i. e. the thesis that it is necessary that everything exists necessarily. This work discusses second-order necessitism, i. e. the thesis that it is necessary that every property exists necessarily, considering lines of argument similar to those displayed on first-order. Three of those arguments are examined. the necessary character ofbeing a property, the occurrence of properties in propositions, and the ontological commitments of the metalanguage where the semantics is formulated. It is argued that none of them are compelling. The justification for second-order necessitism seems to require more substantive metaphysics than formal results, at least if the formal results in view are those discussed here. (shrink)

The most common first- and second-order modal logics either have as theorems every instance of the Barcan and Converse Barcan formulae and of their second-order analogues, or else fail to capture the actual truth of every theorem of classical first- and second-order logic. In this paper we characterise and motivate sound and complete first- and second-order modal logics that successfully capture the actual truth of every theorem of classical first- and second- (...) class='Hi'>order logic and yet do not possess controversial instances of the Barcan and Converse Barcan formulae as theorems, nor of their second-order analogues. What makes possible these results is an understanding of the individual constants and predicates of the target languages as strongly Millian expressions, where a strongly Millian expression is one that has an actually existing entity as its semantic value. For this reason these logics are called ‘strongly Millian’. It is shown that the strength of the strongly Millian second-order modal logics here characterised afford the means to resist an argument by Timothy Williamson for the truth of the claim that necessarily, every property necessarily exists. (shrink)

We prove the following surprising property of Heyting's intuitionistic propositional calculus, IpC. Consider the collection of formulas, φ, built up from propositional variables (p,q,r,...) and falsity $(\perp)$ using conjunction $(\wedge)$ , disjunction (∨) and implication (→). Write $\vdash\phi$ to indicate that such a formula is intuitionistically valid. We show that for each variable p and formula φ there exists a formula Apφ (effectively computable from φ), containing only variables not equal to p which occur in φ, and such that (...) for all formulas ψ not involving $p, \vdash \psi \rightarrow A_p\phi$ if and only if $\vdash \psi \rightarrow \phi$ . Consequently quantification over propositional variables can be modelled in IpC, and there is an interpretation of the second order propositional calculus, IpC2, in IpC which restricts to the identity on first order propositions. An immediate corollary is the strengthening of the usual interpolation theorem for IpC to the statement that there are least and greatest interpolant formulas for any given pair of formulas. The result also has a number of interesting consequences for the algebraic counterpart of IpC, the theory of Heyting algebras. In particular we show that a model of IpC2 can be constructed whose algebra of truth-values is equal to any given Heyting algebra. (shrink)

Open peer commentary on the article “Second-Order Science: Logic, Strategies, Methods” by Stuart A. Umpleby. Upshot: Umpleby’s approach to second-order science is top-down, and as such, fails to distinguish the cognitive mechanisms that provide the direct enacted link between such science and constructivism. When the idea of “ceteris paribus” holds little meaning to the examined situation, we are in the realm of second-order science, or Science 2. Only Science 2 can deal with emergence, volition, (...) and reflexive anticipation. These three properties are how constructivism gets enacted and provide the foundation upon which Science 2 inquiries rest. (shrink)

This paper defends a deflationary conception of properties, according to which a property exists if and only if there could be a predicate with appropriate satisfaction conditions. I argue that purely general properties and relations necessarily exist and discuss the bearing of this conception of properties on the interpretation of higher-order logic and on Quine's charge that higher-order logic is ‘set theory in sheep's clothing’. On my approach, the usual semantics involves a false assimilation of the logic (...) to set theory. I conclude with remarks about implications for the programme of founding mathematical theories in higher-order logic plus abstraction principles. (shrink)

In the first part of the text the distinction between first- and second-order impartiality, along with Brian Barry?s thorough elaboration of their characteristics and the differences between them, is examined. While the former impartiality is related to non-favoring fellow-persons in everyday occasions, the latter is manifested in the institutional structure of society and its political and public morality. In the second part of the article, the concept of public impartiality is introduced through analysis of two examples. In (...) the first example, a Caledonian Club with its exclusive membership is considered as a form of association which is partial, but nevertheless morally acceptable. In the second example, the so-called Heinz dilemma has been reconsidered and the author points to some flaws in Barry?s interpretation, arguing that Heinz?s right of giving advantage to his wife?s life over property rights can be recognized through mitigating circum-stances, and this partiality can be appreciated in the public sphere. Thus, public impartiality imposes limits to the restrictiveness and rigidity of political impartiality implied in second-order morality. (shrink)

We try to answer the question which is the “right” foundation of mathematics, second order logic or set theory. Since the former is usually thought of as a formal language and the latter as a first order theory, we have to rephrase the question. We formulate what we call the second order view and a competing set theory view, and then discuss the merits of both views. On the surface these two views seem to be (...) in manifest conflict with each other. However, our conclusion is that it is very difficult to see any real difference between the two. We analyze a phenomenon we call internal categoricity which extends the familiar categoricity results of second order logic to Henkin models and show that set theory enjoys the same kind of internal categoricity. Thus the existence of non-standard models, which is usually taken as a property of first order set theory, and categoricity, which is usually taken as a property of second order axiomatizations, can coherently coexist when put into their proper context. We also take a fresh look at complete second order axiomatizations and give a hierarchy result for second order characterizable structures. Finally we consider the problem of existence in mathematics from both points of view and find that second order logic depends on what we call large domain assumptions, which come quite close to the meaning of the axioms of set theory. (shrink)

1. The problemLewis identifies the monadic property being F with the set of all actual and possible Fs; the dyadic relation R is identified with the set of actual and possible pairs of things that are related by R; and so on . 1 Egan has argued that the fact that some properties have some of their properties contingently leads to trouble: " Let @ be the actual world, in which being green is [someone's] favourite property, and let (...) w be a world in which being green is [nobody's] favourite property. Since being green is somebody's favourite property in @, it must be a member of … being somebody's favourite property. Since being green is not anybody's favourite property in w, it must not be a member of being somebody's favourite property. Contradiction. " Egan suggests identifying properties with functions from worlds to extensions. However, as Lewis and others have complained, this has the drawback of turning monadic properties into relations . 2 In this article, we shall show that the Lewisian has the resources to block the above argument while simultaneously respecting the adicity of the relevant property and the contingency of the predication without changing his theory of properties. However, our analysis reveals a hidden ambiguity in the Lewisian conception of properties, and on either disambiguation the resulting account of properties seems inadequate.2. On ‘being someone's favourite property’The phrase ‘ being someone's favourite property’ is ambiguous. Given Lewis's ontology of possibilia, where the phrase picks out a monadic property it is not one that is possessed contingently; where it picks out a property that is possessed contingently it is not one that is monadic. But the argument works only if being someone's favourite property is both monadic and possessed contingently.Why should …. (shrink)

Nonnaturalist realism is the view that normative properties are unique kind of stance-independent properties. It has been argued that such views fail to explain why two actions that are exactly alike otherwise must also have the same normative properties. Mark Schroeder and Knut Olav Skarsaune have recently suggested that nonnaturalist realists can respond to this supervenience challenge by taking the primary bearers of normative properties to be action kinds. This paper develops their response in two ways. First, it provides additional (...) motivation for the previous claim about the bearers of normative properties by drawing from the work of H. A. Prichard. Second, and more importantly, it formulates a plausible metaphysical framework based on the contemporary trope theory to explain why action kinds would have their second-order properties, including their normative properties, necessarily. (shrink)

By extending the underlying data structure by new elements, we also extend the intput/output relation generated by a program i.e., no existing run is killed, and no new one lying entirely in the old structure is created. We investigate this stability property for the weak second order semantics derived from nonstandard time models. It turns out that the light face, i.e., parameterless collection principle always induces stable semantics, but the bold face one may be unstable. We give (...) an example where an elementary extension kills a bold face run showing also that the light face semantics is strictly weaker than the bold face one. (shrink)

In my response to Guillermo Rosado-Haddock I discuss the two main issues raised in his paper. The first is that by allowing Henkin’s general models as a legitimate model-theoretic interpretation of second-order logic, I undermine my defense of second-order logic against Quine’s views concerning the primacy of first-order logic. The second is that my treatment of logical truth and logical properties does not take into account various systems of logic and properties of systems of (...) logic such as the Löwenheim-Skolem property.Em minha réplica à Guillermo Rosado-Haddock discuto as duas questões centrais levantadas em seu artigo. A primeira é que ao permitir modelos gerais de Henkin como uma interpretação legítima da lógica de segunda ordem, desvirtuo minha defesa da lógica de segunda ordem contra a visão de Quine respeito à primazia da lógica de primeira ordem. A segunda é que meu tratamento da verdade lógica e das propriedades lógicas não leva em consideração diversos sistemas de lógica e propriedades de sistemas de lógica tais como a propriedade de Löwenheim-Skolem. (shrink)

The last 20 years or so has seen an intense search carried out within Dempster–Shafer theory, with the aim of finding a generalization of the Shannon entropy for belief functions. In that time, there has also been much progress made in credal set theory—another generalization of the traditional Bayesian epistemic representation—albeit not in this particular area. In credal set theory, sets of probability functions are utilized to represent the epistemic state of rational agents instead of the single probability function of (...) traditional Bayesian theory. The Shannon entropy has been shown to uniquely capture certain highly intuitive properties of uncertainty, and can thus be considered a measure of that quantity. This article presents two measures developed with the purpose of generalizing the Shannon entropy for (1) unordered convex credal sets and (2) possibly non-convex credal sets ordered by second order probability, thereby providing uncertainty measures for such epistemic representations. There is also a comparison with the results of the measure AU developed within Dempster–Shafer theory in a few instances where unordered convex credal set theory and Dempster–Shafer theory overlap. (shrink)

In this report I motivate and develop a type-free logic with predicate quantifiers within the general ontological framework of properties, relations, and propositions. In Part I, I present the major ideas of the system informally and discuss its philosophical significance, especially with regard to Russell's paradox. In Part II, I prove the soundness, consistency, and completeness of the logic.

In this paper we propose a Kripke-style semantics for second order intuitionistic propositional logic and we provide a semantical proof of the disjunction and the explicit definability property. Moreover, we provide a tableau calculus which is sound and complete with respect to such a semantics.

Bird’s Ultimate Argument sought to show that Armstrong’s N relationships involving categorical universals can’t entail nomic regularities. In N’s place Bird offered the non-categorical SR relation. Two kinds of objection have been raised: either Bird’s own alternative metaphysics fails in just the same way as Armstrong’s or the target of Bird’s argument may anyway have a way out of the problem. My aim is to reclaim the victory for Bird. I argue that the responses in defence of Armstong’s N relationships (...) fail to acknowledge that Bird was explicitly concerned with Armstrong’s commitment to a categoricalist view of universals. Moreover, Bird’s alternative account does not suffer the same problem since his metaphysics of properties is essentialist. Nevertheless, Bird’s account does need elaborating on to explainwhySR relationships entail their regularities. I offer Schaffer’s Axiomatic Solution as a candidate for this purpose. (shrink)

We introduce a notion of syntactical truth predicate (s.t.p.) for the second order arithmetic PA 2 . An s.t.p. is a set T of closed formulas such that: (i) T(t = u) if and only if the closed first order terms t and u are convertible, i.e., have the same value in the standard interpretation (ii) T(A → B) if and only if (T(A) $\Longrightarrow$ T(B)) (iii) T(∀ x A) if and only if (T(A[x ← t]) for (...) any closed first order term t) (iv) T(∀ X A) if and only if (T(A[X ←▵]) for any closed set definition $\triangle = \{x \mid D(x)\}$ ). S.t.p.'s can be seen as a counterpart to Tarski's notion of (model-theoretical) validity and have main model properties. In particular, their existence is equivalent to the existence of an ω-model of PA 2 , this fact being provable in PA 2 with arithmetical comprehension only. (shrink)

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 existsn 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 on properties which has the same relationship with the Circuit Value Problem as reach has with the Directed Reachability Problem. We use alt to show that Πn⊈ FO, Σn⊈ FO, and Δn+1⊈ FOB, solving some open problems raised in [Mat98]. (shrink)

In this paper we investigate strong logics of first and second order that have certain absoluteness properties. We begin with an investigation of first order logic and the strong logics ω-logic and β-logic, isolating two facets of absoluteness, namely, generic invariance and faithfulness. It turns out that absoluteness is relative in the sense that stronger background assumptions secure greater degrees of absoluteness. Our aim is to investigate the hierarchies of strong logics of first and second (...) class='Hi'>order that are generically invariant and faithful against the backdrop of the strongest large cardinal hypotheses. We show that there is a close correspondence between the two hierarchies and we characterize the strongest logic in each hierarchy. On the first-order side, this leads to a new presentation of Woodin's Ω-logic. On the second-order side, we compare the strongest logic with full second-order logic and argue that the comparison lends support to Quine's claim that second-order logic is really set theory in sheep's clothing. (shrink)

In a first part, I defend that formal semantics can be used as a guide to ontological commitment. Thus, if one endorses an ontological view \(O\) and wants to interpret a formal language \(L\) , a thorough understanding of the relation between semantics and ontology will help us to construct a semantics for \(L\) in such a way that its ontological commitment will be in perfect accordance with \(O\) . Basically, that is what I call constructing formal semantics from an (...) ontological perspective. In the rest of the paper, I develop rigorously and put into practice such a method, especially concerning the interpretation of second-order quantification. I will define the notion of ontological framework: it is a set-theoretical structure from which one can construct semantics whose ontological commitments correspond exactly to a given ontological view. I will define five ontological frameworks corresponding respectively to: (i) predicate nominalism, (ii) resemblance nominalism, (iii) armstrongian realism, (iv) platonic realism, and (v) tropism. From those different frameworks, I will construct different semantics for first-order and second-order languages. Notably I will present different kinds of nominalist semantics for second-order languages, showing thus that we can perfectly quantify over properties and relations while being ontologically committed only to individuals. I will show in what extent those semantics differ from each other; it will make clear how the disagreements between the ontological views extend from ontology to logic, and thus why endorsing an ontological view should have an impact on the kind of logic one should use. (shrink)

This paper describes axiomatic theories SA and SAR, which are versions of second order arithmetic with countably many sorts for sets of natural numbers. The theories are intended to be applied in reverse mathematics because their multi-sorted language allows to express some mathematical statements in more natural form than in the standard second order arithmetic. We study metamathematical properties of the theories SA, SAR and their fragments. We show that SA is mutually interpretable with the theory (...) of arithmetical truth PATr obtained from the Peano arithmetic by adding infinitely many truth predicates. Corresponding fragments of SA and PATr are also mutually interpretable. We compare the proof-theoretical strengths of the fragments; in particular, we show that each fragment SAs with sorts <=s is weaker than next fragment SAs+1. (shrink)

We introduce a herbrandized functional interpretation of a first-order semi-intuitionistic extension of Heyting Arithmetic and study its main properties. We then extend the interpretation to a certain system of second-order arithmetic which includes a (classically false) formulation of the FAN principle and weak König's lemma. It is shown that any first-order formula provable in this system is classically true. It is perhaps worthy of note that, in our interpretation, second-order variables are interpreted by finite (...) sets of natural numbers. (shrink)

The study of graph structure has advanced in recent years with great strides: finite graphs can be described algebraically, enabling them to be constructed out of more basic elements. Separately the properties of graphs can be studied in a logical language called monadic second-order logic. In this book, these two features of graph structure are brought together for the first time in a presentation that unifies and synthesizes research over the last 25 years. The author not only provides (...) a thorough description of the theory, but also details its applications, on the one hand to the construction of graph algorithms, and, on the other to the extension of formal language theory to finite graphs. Consequently the book will be of interest to graduate students and researchers in graph theory, finite model theory, formal language theory, and complexity theory. (shrink)

This paper presents a polarized phase semantics, with respect to which the linear fragment of second order polarized linear logic of Laurent [15] is complete. This is done by adding a topological structure to Girard's phase semantics [9]. The topological structure results naturally from the categorical construction developed by Hamano—Scott [12]. The polarity shifting operator ↓ (resp. ↑) is interpreted as an interior (resp. closure) operator in such a manner that positive (resp. negative) formulas correspond to open (resp. (...) closed) facts. By accommodating the exponentials of linear logic, our model is extended to the polarized fragment of the second order linear logic. Strong forms of completeness theorems are given to yield cut-eliminations for the both second order systems. As an application of our semantics, the first order conservativity of linear logic is studied over its polarized fragment of Laurent [16]. Using a counter model construction, the extension of this conservativity is shown to fail into the second order, whose solution is posed as an open problem in [16]. After this negative result, a second order conservativity theorem is proved for an eta expanded fragment of the second order linear logic, which fragment retains a focalized sequent property of [3]. (shrink)

In recent years Jaegwon Kim has offered an argument – the ‘supervenience argument’ – to show that supervenient mental properties, construed as second- order properties distinct from their first-order realizers, do not have causal powers of their own. In response, several philosophers have argued that if Kim’s argument is sound, it generalizes in such a way as to condemn to causal impotency all properties above the level of basic physics. This paper discusses Kim’s supervenience argument in the (...) context of his reply to this so-called ‘generalization argument’. In particular, the paper focuses on the level/order distinction, to which Kim appeals in his reply to the generalization argument, and on the relation between this distinction and two varieties of functionalism, ‘realizer’ vs. ‘role’ functionalism. The author argues that a proper analysis of the notions of levels and orders undermines Kim’s response to the generalization argument, and suggests that Kim’s reductionist strategy for vindicating the causal powers of mental properties is better served if mental properties are construed as first-order properties, as realizer-functionalism recommends. (shrink)

Let κ and λ be infinite cardinals such that κ ≤ λ (we have new information for the case when $\kappa ). Let T be a theory in L κ +, ω of cardinality at most κ, let φ(x̄, ȳ) ∈ L λ +, ω . Now define $\mu^\ast_\varphi (\lambda, T) = \operatorname{Min} \{\mu^\ast:$ If T satisfies $(\forall\mu \kappa)(\exists M_\chi \models T)(\exists \{a_i: i Our main concept in this paper is $\mu^\ast_\varphi (\lambda, \kappa) = \operatorname{Sup}\{\mu^\ast(\lambda, T): T$ is a theory (...) in L κ +, ω of cardinality κ at most, and φ (x, y) ∈ L λ +, ω }. This concept is interesting because of THEOREM 1. Let $T \subseteq L_{\kappa^+,\omega}$ of cardinality ≤ κ, and φ (x̄, ȳ) ∈ L λ +, ω . If $(\forall\mu then $(\forall_\chi > \kappa) I(\chi, T) = 2^\chi$ (where I(χ, T) stands for the number of isomorphism types of models of T of cardinality χ). Many years ago the second author proved that $\mu^\ast (\lambda, \kappa) \leq \beth_{(2^\lambda)^+}$ . Here we continue that work by proving. THEOREM 2. $\mu^\ast (\lambda, \aleph_0) = \beth_{\lambda^+}$ . THEOREM 3. For every κ ≤ λ we have $\mu^\ast (\lambda, \kappa) \leq \beth)_{(\lambda^\kappa)}^+$ . For some κ or λ we have better bounds than in Theorem 3, and this is proved via a new two cardinal theorem. THEOREM 4. For every $\kappa \leq \lambda, T \subseteq L_{\kappa^+,\omega}$ , and any set of formulas $\Lambda \subseteq L_{\lambda^+,\omega}$ such that $\Lambda \subseteq L_{\kappa^+,\omega}$ , if T is (Λ,μ)-unstable for μ satisfying μ μ * (λ, κ) = μ then T is Λ-unstable (i.e. for every χ ≥ λ, T is (Λ, χ)-unstable). Moreover, T is L κ +, ω -unstable. In the second part of the paper, we show that always in the applications it is possible to replace the function I(χ, T) by the function IE(χ, T), and we give an application of the theorems to Boolean powers. (shrink)

Although Boyle has been regarded as a champion of the seventeenth century Cartesian mechanical philosophy, I defend the position that Boyle’s views conciliate between a strictly mechanistic conception of fundamental matter and a non-reductionist conception of chemical qualities. In particular, I argue that this conciliation is evident in Boyle’s ontological distinction between fundamental corpuscles endowed with mechanistic properties and higher-level corpuscular concretions endowed with chemical properties. Some of these points have already been acknowledged by contemporary scholars, and I actively engage (...) with their ideas in this paper. However I attempt to contribute to the debate over Boyle’s mechanical philosophy by arguing that Boyle’s writings suggest an emergentist, albeit still mechanistic, notion of chemical properties. I contrast Boyle’s views against those of strict reductionist mechanical philosophers, focusing on the famous debate with Spinoza over the redintegration of niter, and argue that Boyle’s complex chemical ontology provides a more satisfactory understanding of chemical phenomena than is provided by a strictly reductionist and Cartesian mechanical philosophy. (shrink)

The pointwise ergodic theorem is nonconstructive. In this paper, we examine origins of this non-constructivity, and determine the logical strength of the theorem and of the auxiliary statements used to prove it. We discuss properties of integrable functions and of measure preserving transformations and give three proofs of the theorem, though mostly focusing on the one derived from the mean ergodic theorem. All the proofs can be carried out in ACA₀; moreover, the pointwise ergodic theorem is equivalent to (ACA) over (...) the base theory RCA₀. (shrink)

In this paper I take second order-quantification to be a sui generis form of quantification, irreducible to first-order quantification, and I examine the implications of doing so for the debate over the existence of properties. Nicholas K. Jones has argued that adding sui generis second-order quantification to our ideology is enough to establish that properties exist. I argue that Jones does not settle the question of whether there are properties because—like other ontological questions—it is first- (...) class='Hi'>order. Then I examine three of the main arguments for the existence of properties. I conclude that sui generis second-order quantification defeats the “one over many” argument and that, coupled with second-order predication, it also defeats the reference and quantification arguments. (shrink)

In “Properties and the Interpretation of Second-Order Logic” Bob Hale develops and defends a deflationary conception of properties where a property with particular satisfaction conditions actually exists if and only if it is possible that a predicate with those same satisfaction conditions exists. He argues further that, since our languages are finitary, there are at most countably infinitely many properties and, as a result, the account fails to underwrite the standard semantics for second-order logic. Here (...) a more lenient version of the view is explored, which allows for the possibility of countably infinite predicates understood as the product of linguistic supertasks. This enriched deflationist account of properties—the Infinitary Deflationary Conception of Existence—supports the standard semantics for models with countable first-order domains, and allows one to prove the categoricity of the second-order Peano axioms. (shrink)

Do properties have intrinsic properties of their own? If so, which second-order properties are intrinsic? This paper introduces two competing views about second-order intrinsicality: generalism, according to which the intrinsic–extrinsic distinction cuts across all orders of properties and applies to the properties of properties as well as the properties of objects, and objectualism, according to which intrinsicality is a feature exclusive to the properties of objects. The case for generalism is then surveyed along with some proposals (...) for distinguishing intrinsic second-order properties from extrinsic ones. After addressing these broad questions about the nature of second-order intrinsicality, the Problem of Accidental Intrinsic Properties of Properties is introduced and put to work as a case study for the significance of second-order intrinsicality. The connection between this problem and the metaphysics of quantitative properties is then examined. (shrink)