I offer a series of axiomatic formalizations of Divine Command Theory motivated by certain methodological considerations. Given these considerations, I present what I take to be the best axiomatization of Divine Command Theory, an axiomatization which requires a non-standardsemantics for quantified modal logic.

The sentence Irving was closer to me than he was to most of the others contains a quantifier, most of the other, in the scope a comparative. The first part of this paper explains the challenges presented by such cases to existing approaches to the semantics of the comparative. The second part presents a new analysis of comparatives based on intervals rather than points on a scale. This innovation is analogized to the move from moments to intervals in tense (...) semantics. The remainder of the paper is concerned with an interval-based semantics of degree in relation to issues other than the comparative proper. The paper begins with a discussion of the role negative polarity has played in studies on the semantics of comparatives. (shrink)

This paper revisits intervention effects in Mandarin Chinese why-questions. I present a novel empirical generalization, in which it is shown that the ability for quantifiers to induce intervention hinges upon their monotonicity and their ability to be interpreted as topics. I then propose a semantic account of intervention that correlates topicality with the monotone properties of intervening operators. A crucial assumption in this account is that why-questions in Chinese are idiosyncratic, in that the Chinese equivalent of why directly merges (...) at a high scope position that stays above a propositional argument. Combining the semantic idiosyncrasies of why-questions with the theory of topicality, I conclude that a wide range of intervention phenomena can be explained in terms of interpretation failure. (shrink)

This chapter argues that special quantifiers such as 'something' when occurring in argument position are not ordinary or substitutional quantifiers; rather they have a reifying force introducing a domain of tropes or kinds of tropes to quantify over.

The quantified relevant logic RQ is given a new semantics in which a formula for all xA is true when there is some true proposition that implies all x-instantiations of A. Formulae are modelled as functions from variable-assignments to propositions, where a proposition is a set of worlds in a relevant model structure. A completeness proof is given for a basic quantificational system QR from which RQ is obtained by adding the axiom EC of 'extensional confinement': for all x(A (...) V B) -> (A V for all xB). with x not free in A. Validity of EC requires an additional model condition involving the boolean difference of propositions. A QR-model falsifying EC is constructed by forming the disjoint union of two natural arithmetical structures in which negation is interpreted by the minus operation. (shrink)

A semantics for quantified modal logic is presented that is based on Kleene's notion of realizability. This semantics generalizes Flagg's 1985 construction of a model of a modal version of Church's Thesis and first-order arithmetic. While the bulk of the paper is devoted to developing the details of the semantics, to illustrate the scope of this approach, we show that the construction produces (i) a model of a modal version of Church's Thesis and a variant of a (...) modal set theory due to Goodman and Scedrov, (ii) a model of a modal version of Troelstra's generalized continuity principle together with a fragment of second-order arithmetic, and (iii) a model based on Scott's graph model (for the untyped lambda calculus) which witnesses the failure of the stability of non-identity. (shrink)

The Mares-Goldblatt semantics for quantified relevant logics have been developed for first-order extensions of R, and a range of other relevant logics and modal extensions thereof. All such work has taken place in the the ternary relation semantic framework, most famously developed by Sylvan and Meyer. In this paper, the Mares-Goldblatt technique for the interpretation of quantifiers is adapted to the more general neighbourhood semantic framework, developed by Sylvan, Meyer, and, more recently, Goble. This more algebraic semantics (...) allows one to characterise a still wider range of logics, and provides the grist for some new results. To showcase this, we show, using some non-augmented models, that some quantified relevant logics are not conservatively extended by connectives the addition of which do conservatively extend the associated propositional logics, namely fusion and the dual implication. We close by proposing some further uses to which the neighbourhood Mares-Goldblatt semantics may be put. (shrink)

When it comes to Kripke-style semantics for quantified modal logic, there’s a choice to be made concerning the interpretation of the quantifiers. The simple approach is to let quantifiers range over all possible objects, not just objects existing in the world of evaluation, and use a special predicate to make claims about existence. This is the constant domain approach. The more complicated approach is to assign a domain of objects to each world. This is the varying domain (...) approach. Assuming that all terms denote, the semantics of predication on the constant domain approach is obvious: either the denoted object has the denoted property in the world of evaluation, or it hasn’t. On the varying domain approach, there’s a third possibility: the object in question doesn’t exist. Terms may denote objects not included in the domain of the world of evaluation. The question is whether an atomic formula then should be evaluated as true or false, or if its truth value should be undefined. This question, however, cannot be answered in isolation. The consequences of one’s choice depends on the interpretation of molecular formulas. Should the negation of a formula whose truth value is undefined also be undefined? What about conjunction, universal quantification and necessitation? The main contribution of this paper is to identify two partial semantics for logical operators, a weak and a strong one, which uniquely satisfy a list of reasonable constraints. I also show that, provided that the point of using varying domains is to be able to make certain true claims about existence without using any existence predicate, this result yields two possible partial semantics for quantified modal logic with varying domains. (shrink)

We investigate the universal fragment of intuitionistic logic focussing on equality of proofs. We give categorical models for that and prove several completeness results. One of them is a generalization of the well known Yoneda lemma and the other is an extension of Harvey Friedman's completeness result for typed lambda calculus.

In part I, we presented an algebraic-style of semantics, which we called “content semantics,” for quantified relevant logics based on the weak systemBBQ. We showed soundness and completeness with respect to theunreduced semantics ofBBQ. In part II, we proceed to show soundness and completeness for extensions ofBBQ with respect to this type of semantics. We introducereduced semantics which requires additional postulates for primeness and saturation. We then conclude by showing soundness and completeness forBB d Q (...) and its extentions with respect to this reduced semantics. (shrink)

We present an algebraic-style of semantics, which we call a content semantics, for quantified relevant logics based on the weak system BBQ. We show soundness and completeness for all quantificational logics extending BBQ and also treat reduced modelling for all systems containing BB d Q. The key idea of content semantics is that true entailments AB are represented under interpretation I as content containments, i.e. I(A)I(B) (or, the content of A contains that of B). This is opposed (...) to the truth-functional way which represents true entailments as truth-preservations over all set-ups (or worlds), i.e. (VaK) (if I(A, a) = T then I(B, a)= T). (shrink)

This paper uses an "admissible set semantics" to treat quantification in quantified modal logics. The truth condition for the universal quantifier states that a universally quantified statement (x)A(x) is true at a world w if and only if there is some proposition true at that world that entails every instance of A(x). It is shown that, for any canonical propositional modal logic the corresponding admissible set semantics characterises the quantified version of that modal logic.

The paper presents an alternative substitutional semantics for first-order modal logic which, in contrast to traditional substitutional (or truth-value) semantics, allows for a fine-grained explanation of the semantical behavior of the terms from which atomic formulae are composed. In contrast to denotational semantics, which is inherently reference-guided, this semantics supports a non-referential conception of modal truth and does not give rise to the problems which pertain to the philosophical interpretation of objectual domains (concerning, e.g., possibilia or (...) trans-world identity). The paper also proposes the notion of modality de nomine as an alternative to the denotational notion of modality de re. (shrink)

In "An Alternative Semantics for Quantified Relevant Logic" (JSL 71 (2006)) we developed a semantics for quantified relevant logic that uses general frames. In this paper, we adapt that model theory to treat quantified modal logics, giving a complete semantics to the quantified extensions, both with and without the Barcan formula, of every proposi- tional modal logic S. If S is canonical our models are based on propositional frames that validate S. We employ frames in which not (...) every set of worlds is an admissible proposition, and an alternative interpretation of the uni- versal quantifier using greatest lower bounds in the lattice of admissible propositions. Our models have a fixed domain of individuals, even in the absence of the Barcan formula. For systems with the Barcan formula it is possible to preserve the usual Tarskian reading of the quantifier, at the expensive of sometimes losing va- lidity of S in the underlying propositional frames. We apply our results to a number of logics, including S4.2, S4M and KW, whose quantified extensions are incomplete for the standard semantics. (shrink)

Many systems of quantified modal logic cannot be characterised by Kripke's well-known possible worlds semantic analysis. This book shows how they can be characterised by a more general 'admissible semantics', using models in which there is a restriction on which sets of worlds count as propositions. This requires a new interpretation of quantifiers that takes into account the admissibility of propositions. The author sheds new light on the celebrated Barcan Formula, whose role becomes that of legitimising the Kripkean (...) interpretation of quantification. The theory is worked out for systems with quantifiers ranging over actual objects, and over all possibilia, and for logics with existence and identity predicates and definite descriptions. The final chapter develops a new admissible 'cover semantics' for propositional and quantified relevant logic, adapting ideas from the Kripke-Joyal semantics for intuitionistic logic in topos theory. This book is for mathematical or philosophical logicians, computer scientists and linguists. (shrink)

This work presents the structure, distribution and semantic interpretation of quantificational expressions in languages from diverse language families and typological profiles. The current volume pays special attention to underrepresented languages of different status and endangerment level. Languages covered include American and Russian Sign Languages, and sixteen spoken languages from Africa, Australia, Papua, the Americas, and different parts of Asia. The articles respond to a questionnaire the editors constructed to enable detailed crosslinguistic comparison of numerous features. They offer comparable information on (...) semantic classes of quantifiers (generalized existential, generalized universal, proportional, partitive), syntactically complex quantifiers (intensive modification, Boolean compounds, exception phrases, et cetera), and several more specific issues such as quantifier scope ambiguities, floating quantifiers, and binary (type 2) quantifiers. The book is intended for semanticists, logicians interested in quantification in natural language, and general linguists as articles are meant to be descriptive and theory independent. The book continues and expands the coverage of the Handbook of Quantifiers in Natural Language (2012) by the same editors, and extends the earlier work in Matthewson (2008), Gil and others (2013) and Bach et al (1995). (shrink)

LetMbe a countably infinite ω-categorical structure. Consider Aut(M) as a complete metric space by definingd(g, h) = Ω{2−n:g(xn) ≠h(xn) org−1(xn) ≠h−1(xn)} where {xn:n∈ ω} is an enumeration ofMAn automorphism α ∈ Aut(M) is generic if its conjugacy class is comeagre. J. Truss has shown in [11] that if the set P of all finite partial isomorphisms contains a co-final subset P1closed under conjugacy and having the amalgamation property and the joint embedding property then there is a generic automorphism. In the (...) present paper we give a weaker condition of this kind which is equivalent to the existence of generic automorphisms. Really we give more: a characterization of the existence of generic expansions (defined in an appropriate way) of an ω-categorical structure. We also show that Truss' condition guarantees the existence of a countable structure consisting of automorphisms ofMwhich can be considered as an atomic model of some theory naturally associated toM. We do it in a general context of weak models for second-order quantifiers.The author thanks Ludomir Newelski for pointing out a mistake in the first version of Theorem 1.2 and for interesting discussions. Also, the author is grateful to the referee for very helpful remarks. (shrink)

Specificity has been defined in the linguistic literature according to two different criteria: one corresponding to Quine's opaque and transparent contexts, and the other to criteria closely related to Donellan's referential/attributive distinction. The paper argues that only the former definition is a semantic one since it alone manifests linguistic correlates. The meaning changes involving referential/attributive factors are pragmatic in nature. In the concluding section is is argued that the semantics of specificity is completely independent of the relative scope interpretation (...) of an indefinite noun phrase in relation to other quantified nouns in the sentence. This is demonstrated using sentences which contain an indefinite interacting with both an opaque operator and a second quantifier. It is shown that such sentences can be four ways ambiguous. (shrink)

By supplying propositional calculus with a probability semantics we showed, in our 1996, that finite stochastic problems can be treated by logic-theoretic means equally as well as by the usual set-theoretic ones. In the present paper we continue the investigation to further the use of logical notions in probability theory. It is shown that quantifier logic, when supplied with a probability semantics, is capable of treating stochastic problems involving countably many trials.

A system FDQ of first degree entailment with quantification, extending classical quantification logic Q by an entailment connective, is axiomatised, and the choice of axioms defended and also, from another viewpoint, criticised. The system proves to be the equivalent to the first degree part of the quantified entailmental system EQ studied by Anderson and Belnap; accordingly the semantics furnished are alternative to those provided for the first degree of EQ by Belnap. A worlds semantics for FDQ is presented, (...) and the soundness and completeness of FDQ proved, the main work of the paper going into the proof of completeness. The adequacy result is applied to yield, as well as the usual corollaries, weak relevance of FDQ and the fact that FDQ is the common first degree of a wide variety of (constant domain) quantified relevant logics. Finally much unfinished business at the first degree is discussed. (shrink)

If to be is to be the value of a bound variable, then the acknowledgment and denial of the existence of chairs amounts to a serious disagreement about the range of a quantifier. However, by resorting to the intrinsic hierarchical structure of hi-world semantics, we find that the varying of domains from worlds to worlds can actually be accommodated within a unified framework. With the introduction of a universal domain D of hi-individuals and an existence predicate E that serves (...) as a realization operator, a new semantics for quantified modal logic is proposed. It allows individual variables to range over individuals in different levels of a hi-world, and is indifferent to the ontological debate about the existence of chairs. (shrink)

(1) is an example of an adjectival comparative. In it, the adjective important is flanked by more and a comparative clause headed by than. This article is a survey of recent ideas about the interpretation of comparatives, including (i) the underlying semantics based on the idea of a threshold; (ii) the interpretation of comparative clauses that include quantifiers (brighter than on many other days); (iii) remarks on differentials such as much in (1) above: what they do in the (...) comparative and what they do elsewhere in the language; (iv) the relationship between comparatives and other Degree constructions (e.g. as important, too impor- tant); and (v) the types of phrases in which comparatives are found (adjective: tighter versus noun: more water). Given the nature and purpose of this essay, I have tried not to presuppose background in formal semantics and I have departed from standard practice in journal articles by, as much as possible, not interrupting the flow with footnotes and references. There are two appendices. The first provides more analytical detail and there I do rely on formal techniques of natural language semantics. The second covers the sources for the ideas surveyed here. (shrink)

Some theories assume that sentences like (i) with a presupposition trigger in the scope of a quantifier carry an existential presupposition, as in (ii); others assume that they carry a universal presupposition, as in (iii). No student knows that he is lucky. Existential presupposition: At least one student is lucky.Universal presupposition: Every student is lucky. This work is an experimental investigation of this issue in French. Native speakers were recruited to evaluate the robustness of the inference from (i) to (iii). (...) The main result is that presuppositions triggered from the scope of the quantifier aucun‘no’ are in fact universal. But the present results also suggest that the presuppositions triggered from the scope of other quantifiers depend on the quantifier. This calls for important changes in the main theories of presupposition projection. (shrink)

In this paper, we introduce a new approach to independent quantifiers, as originally introduced in Informational independence as a semantic phenomenon by Hintikka and Sandu [9] under the header of independence-friendly languages. Unlike other approaches, which rely heavily on compositional methods, we shall analyze independent quantifiers via equilibriums in strategic games. In this approach, coined equilibrium semantics, the value of an IF sentence on a particular structure is determined by the expected utility of the existential player in (...) any of the game’s equilibriums. This approach was suggested in Henkin quantifiers and complete problems by Blass and Gurevich [2] but has not been taken up before. We prove that each rational number can be realized by an IF sentence. We also give a lower and upper bound on the expressive power of IF logic under equilibrium semantics. (shrink)

In this paper we reexamine the question of whether questions areinherently intensional entities. We do so by proposing a novelextensional theory of questions, based on a re-interpretation of thedomain of t as a bilattice rather than the usual booleaninterpretation. We discuss the adequacy of our theory with respect tothe adequacy criteria imposed on the semantics of questionsby (Groenendijk and Stokhof 1997). We show that the theory is able to account in astraightforward manner for some complex issues in the (...) class='Hi'>semantics ofquestions including coordinated questions, combined indicative andinterrogative sentences, questions with quantifiers, and theimpossibility of negating questions. (shrink)

Quantifiers in Frege's Grundgesetze like are not well-defined because the part Fx & Gx stands for a concept but the yoking conjunction is horizontalised and must stand for a truth-value. This standard interpretation is rejected in favor of a substitutional reading that, it is argued, both conforms better to the text and is well-defined. The theory of the horizontal is investigated in detail and the composite reading of Frege's connectives as made up of horizontals is rejected. The sense in (...) which the Grundgesetze has a many-valued but classical logic is explained by proving that its propositional fragment (under the standard interpretation) and Bochvar's 3-valued logic are instances of the same metatheoretic methods. Historically, the paper argues for a more naive but well-defined reading of the text. Theoretically, it provides a formally adequate statement of that semantics, as well as developing the abstract metatheory which embraces Bochvar's language and the Fregean fragment. (shrink)

This paper sets forth a new theory of quantifiers and term connectives, called shadow theory , which should help simplify various semantic theories of natural language by greatly reducing the need of Montagovian proper names, type-shifting, and λ-conversion. According to shadow theory, conjunctive, disjunctive, and negative noun phrases such as John and Mary , John or Mary , and not both John and Mary , as well as determiner phrases such as every man , some woman , and the (...) boys , are all of semantic type e and denote individual-like objects, called shadows — conjunctive , disjunctive , or negative shadows, such as John-and-Mary, John-or-Mary, and not-(John-and-Mary). There is no essential difference between quantification and denotation: quantification is nothing but denotation of shadows. Individuals and shadows constitute a Boolean structure. Formal language LSD (Language for Shadows with Distributivity), which takes compound terms to denote shadows, is investigated. Expansions and enrichments of LSD are also considered toward the end of the paper. (shrink)

We provide tools for a concise axiomatization of a broad class of quantifiers in many-valued logic, so-called distribution quantifiers. Although sound and complete axiomatizations for such quantifiers exist, their size renders them virtually useless for practical purposes. We show that for quantifiers based on finite distributive lattices compact axiomatizations can be obtained schematically. This is achieved by providing a link between skolemized signed formulas and filters/ideals in Boolean set lattices. Then lattice theoretic tools such as Birkhoff's (...) representation theorem for finite distributive lattices are used to derive tableau-style axiomatizations of distribution quantifiers. (shrink)

In this paper, we study natural language constructions which were first examined by Barwise: The richer the country, the more powerful some of its officials. Guided by Barwise’s observations, we suggest that conceivable interpretations of such constructions express the existence of various similarities between partial orders such as homomorphism or embedding. Semantically, we interpret the constructions as polyadic generalized quantifiers restricted to finite models. We extend the results obtained by Barwise by showing that similarity quantifiers are not expressible (...) in elementary logic over finite models. We also investigate whether the proposed readings are sound from the cognitive perspective. We prove that almost all similarity quantifiers are intractable. This leads us to first-order variants, which only approximate the strong readings, but are cognitively more plausible. Driven by the question of ambiguity, we recall Barwise’s argumentation in favour of strong readings, enriching it with some arguments of our own. Given that Barwise-like sentences are indeed ambiguous, we use a generalized Strong Meaning Hypothesis to derive predictions for their verification. Finally, we propose a hypothesis according to which conflicting pressures of communication and cognition might give rise to an ambiguous construction, provided that different semantic variants of the construction withstand different pressures involved in its usage. (shrink)

I present an analysis of Free Choice Items (FCIs), based on Scandinavian, where FCIs are complex and distinct from polarity sensitive items. Scandinavian FCIs are argued to have two components. One is a universal quantifying into modal contexts. The other is an operator mapping a type (s,t) expression onto itself, adjoining to the closest type t or (s,t) expression. Thus invoking Intensional Functional Application, this operator requires the presence of a modal in the scope of the universal quantifier. Facts concerning (...) ‘essential connections’ and ‘existential import’ are accounted for by assuming that the FC determiner has the option of acting like a quantifier. (shrink)

In the work of both Matti Eklund and John Hawthorne there is an influential semantic argument for a maximally expansive ontology that is thought to undermine even modest forms of quantifier variance. The crucial premise of the argument holds that it is impossible for an ontologically "smaller" language to give a Tarskian semantics for an ontologically "bigger" language. After explaining the Eklund-Hawthorne argument (in section I), we show this crucial premise to be mistaken (in section II) by developing a (...) Tarskian semantics for a mereological universalist language within a mereological nihilist language (a case which we, and Eklund and Hawthorne, take as representative). After developing this semantics we step back (in section III) to discuss the philosophical motivations behind the Eklund- Hawthorne argument’s demand for a semantics. We ultimately conclude that quantifier variantists can meet any demand for a semantics that might reasonably be imposed upon them. (shrink)

This paper gives a uniform account of the meaning of generalizations with explicit exceptions that employ the prepositions “but”, “except”, and “except for”. Our theory is that exceptives depend on generalizations, which can but need not be universal, whose generality they limit, and some of whose exceptions they comment on. Every generalization intrinsically partitions its domain of applicability into regular cases, which are as it says to expect, and exceptions, which are not. A generalization’s exceptions are instances that falsify it (...) if sufficiently prevalent. These two facts underpin the meaning of exceptives as combining a _generality claim_ with an _exception claim_, giving correct truth conditions for the several ways the three exceptive prepositions are used, and significantly improving on existing semantic accounts in the literature. We support this by analyzing a wide range of examples. The analysis applies whether or not the phrase following the exceptive preposition is a DP, and whether or not the generalization is expressed with a quantifier. We further argue that these exceptive prepositions are synonymous, contrary to the widely held view that a difference in meaning explains their different syntactic distributions. (shrink)

The paper presents a semantics for quantified modal logic which has a weaker axiomatization than the usual Kripke semantics. In particular, the Barcan Formula and its converse are not valid with the proposed semantics. Subclasses of models which validate BF and other interesting formulas are presented. A completeness theorem is proved, and the relation between this result and completeness with respect to Kripke models is investigated.

Natural language sentences that talk about two or more sets of entities can be assigned various readings. The ones in which the sets are independent of one another are particularly challenging from the formal point of view. In this paper we will call them ‘Independent Set (IS) readings’. Cumulative and collective readings are paradigmatic examples of IS readings. Most approaches aiming at representing the meaning of IS readings implement some kind of maximality conditions on the witness sets involved. Two kinds (...) of maximization have been proposed in the literature: ‘Local’ and ‘Global’ maximization. In this paper, we present an online questionnaire whose results appear to support Local maximization. The latter seems to capture the proper interplay between the semantics and the pragmatics of multi-quantifier sentences, provided that witness sets are selected on pragmatic grounds. (shrink)

In Symbolic Logic (1932), C. I. Lewis developed five modal systems S1 − S5. S4 and S5 are so-called normal modal systems. Since Lewis and Langford’s pioneering work many other systems of this kind have been investigated, among them the 32 systems that can be generated by the five axioms T, D, B, 4 and 5. Lewis also discusses how his systems can be augmented by propositional quantifiers and how these augmented logics allow us to express some interesting ideas (...) that cannot be expressed in the corresponding quantifier-free logics. In this paper, I will develop 64 normal modal semantic tableau systems that can be extended by propositional quantifiers yielding 64 extended systems. All in all, we will investigate 128 different systems. I will show how these systems can be used to prove some interesting theorems and I will discuss Lewis’s so-called existence postulate and some of its consequences. Finally, I will prove that all normal modal systems are sound and complete and that all systems (including the extended systems) are sound with respect to their semantics. It is left as an open question whether or not the extended systems are complete. (shrink)

The next generation of Geographic Information Systems is anticipated to automate some of the reasoning required for spatial analysis. An important step in the development of such systems is to gain a better understanding and corresponding modeling practice of when to apply arithmetic operations to quantities. The concept of extensivity plays an essential role in determining when quantities can be aggregated by summing them, and when this is not possible. This is of particular importance to geographic information systems, which serve (...) to quantify phenomena across space and time. However, currently, multiple contrasting definitions of extensivity exist, and none of these suffice for handling the different practical cases occurring in geographic information. As a result, analysts predominantly rely on intuition and ad hoc reasoning to determine whether two quantities are additive. In this paper, we present a novel approach to formalizing the concept of extensivity. Though our notion as such is not restricted to quantifications occurring within geographic information, it is particularly useful for this purpose. Following the idea of spatio-temporal controls by Sinton, we define extensivity as a property of measurements of quantities with respect to a controlling quantity, such that a sum of the latter implies a sum of the former. In our algebraic definition of amounts and other quantities, we do away with some of the constraints that limit the usability of older approaches. By treating extensivity as a relation between amounts and other types of quantities, our definition offers the flexibility to relate a quantity to many domains of interest. We show how this new notion of extensivity can be used to classify the kinds of amounts in various examples of geographic information. (shrink)

In an English article (‘On Expressions’) Professor Shen Youding writes, ‘the meaning of a name is not the object which is mentioned by means of it’ (Shen 1992: 11). This remark touches on a big issue that has divided contemporary philosophers of language. On the one side is the Millian (after J.S. Mill), who maintains that the semantic value of a name is the object which it designates, denotes, or refers to (as I use them here, these three terms are (...) interchangeable). [1] On the other side is the Fregean (after Gottlob Frege), who thinks that a name has a sense in addition to a reference. [2] Though Professor Sheng’s remark is too brief for us to claim that he would have been prepared to endorse the Fregean idea, it is clear that he was not a Millian. (shrink)

One well known problem regarding quantifiers, in particular the 1storder quantifiers, is connected with their syntactic categories and denotations. The unsatisfactory efforts to establish the syntactic and ontological categories of quantifiers in formalized first-order languages can be solved by means of the so called principle of categorial compatibility formulated by Roman Suszko, referring to some innovative ideas of Gottlob Frege and visible in syntactic and semantic compatibility of language expressions. In the paper the principle is introduced for (...) categorial languages generated by the Ajdukiewicz’s classical categorial grammar. The 1st-order quantifiers are typically ambiguous. Every 1st-order quantifier of the type k > 0 is treated as a two-argument functorfunction defined on the variable standing at this quantifier and its scope (the sentential function with exactly k free variables, including the variable bound by this quantifier); a binary function defined on denotations of its two arguments is its denotation. Denotations of sentential functions, and hence also quantifiers, are defined separately in Fregean and in situational semantics. They belong to the ontological categories that correspond to the syntactic categories of these sentential functions and the considered quantifiers. The main result of the paper is a solution of the problem of categories of the 1st-order quantifiers based on the principle of categorial compatibility. (shrink)

This thesis deals with the phenomenon of attitude reporting. More specifically, it provides a unified semantics of de re and de se belief reports. After arguing that de se belief is best thought of as a special case of de re belief, I examine whether we can extend this unification to the realm of belief reports. I show how, despite very promising first steps, previous attempts in this direction ultimately fail with respect to some relatively recent linguistic data involving (...) quantified and infinitival reports, logophoric constructions, and monstrously shifted indexicals. Formalizing my idea of a contextual resolution of acquaintance relations in a dynamic framework, I arrive at an alternative analysis that handles all these data. (shrink)

One well known problem regarding quantifiers, in particular the 1st order quantifiers, is connected with their syntactic categories and denotations.The unsatisfactory efforts to establish the syntactic and ontological categories of quantifiers in formalized first-order languages can be solved by means of the so called principle of categorial compatibility formulated by Roman Suszko, referring to some innovative ideas of Gottlob Frege and visible in syntactic and semantic compatibility of language expressions. In the paper the principle is introduced for (...) categorial languages generated by the Ajdukiewicz’s classical categorial grammar. The 1st-order quantifiers are typically ambiguous. Every 1st-order quantifier of the type k > 0 is treated as a two-argument functor-function defined on the variable standing at this quantifier and its scope (the sentential function with exactly k free variables, including the variable bound by this quantifier); a binary function defined on denotations of its two arguments is its denotation. Denotations of sentential functions, and hence also quantifiers, are defined separately in Fregean and in situational semantics. They belong to the ontological categories that correspond to the syntactic categories of these sentential functions and the considered quantifiers. The main result of the paper is a solution of the problem of categories of the 1st-order quantifiers based on the principle of categorial compatibility. (shrink)

By algebraic means, we give an equational axiomatization of the equational fragments of various systems of arithmetic. We also introduce a faithful semantics according to which, for every reasonable system T for arithmetic, there is a model where exactly the theorems of T are true.

Investigating instances where lexical selection fails can lead to deeper insights into the cognitive machinery and architecture supporting successful word retrieval and speech production. In this paper, we used a multiplex lexical network approach that combines semantic and phonological similarities among words to model the structure of the mental lexicon. Network measures at different levels of analysis (degree, network distance, and closeness centrality) were used to investigate the influence of network structure on picture naming accuracy and errors by people with (...) Anomic, Broca's, Conduction, and Wernicke's aphasia. Our results reveal that word retrieval is influenced by the multiplex lexical network structure in at least two ways—(a) the accuracy of production and error type on incorrect productions were influenced by the degree and closeness centrality of the target word, and (b) error type also varied in terms of network distance between the target word and produced error word. Taken together, the analyses demonstrate that network science techniques, particularly the use of the multiplex lexical network to simultaneously represent semantic and phonological relationships among words, reveal how the structure of the mental lexicon influences language processes beyond traditionally examined psycholinguistic variables. We propose a framework for how the multiplex lexical network approach allows for understanding the influence of mental lexicon structure on word retrieval processes, with an eye toward a better understanding of the nature of clinical impairments, like aphasia. (shrink)