Objective. Study of the validity and reliability of the discourse approach for the psycholinguistic understanding of the nature, structure, and features of the linguistic consciousness functioning. -/- Materials & Methods. This paper analyzes artificial neural network models built on the corpus of texts, which were obtained in the process of experimental research of the coronavirus quarantine concept as a new category of linguistic consciousness. The methodology of feedforward artificial neural networks (multilayer perceptron) was used in order to assess the possibility (...) of predicting the leading texts semantics based on the discourses ranks and their place in the respective linear sequence. Same baseline parameters were used to predict respondents' self-assessments of changes in their psychological well-being and in daily life routine during the quarantine, as well as to predict their preferences of the quarantine strategies. The study relied on basic ideas about discourse as a meaning constituted by the dispersion of other meanings (Foucault). The same dispersion mechanism realizes itself in interdiscourse interaction, forming a discursive formation at a higher level. The method of T-units (Hunt) was used to identify and count discourses in the texts. The ranking of discourses was provided based on the criterion of their semantic-syntactic autonomy. -/- Results. The conducted neural network modeling revealed a high accuracy in predicting the work of the linguistic consciousness functions associated with retrospective self-assessment and anticipatory imagination of the respondents. Another result of this modeling is a partial confirmation of the assumption concerning existence a relationship between the structural parameters of the discursive field (the rank of the discourses and their place in the respective linear sequence) and the leading semantics of the text. -/- Conclusions. A discourse approach to the study of linguistic consciousness, understanding of its structure and functioning features seems to be reasonably appropriate. The implementation of the approach presupposes the need to form a base of linguistic corpora with the inclusion in each text markup of such parameters as: the presence of specific discourses, their ranks, positions in the linear sequence of discourses. (shrink)

It’s widely accepted that normativity is not subject to truth values. The underlying reasoning is that truth values can only be predicated of descriptive statements; normative statements are prescriptive, not descriptive; thus truth value predicates cannot be assigned to normative statements. Hence, deonticity lacks logical semantics. This semantic monism has been challenged over the last decades from a series of perspectives that open the way for legal logics with imperative semantics. In the present paper I will go back to (...) Kant and review his understanding of practical judgments, presenting it as supported by a pluralistic semantics. From this perspective a norm of Law is a logical expression that includes as content a generic description of a possible behavior by a generality of juridical agents, and assigns to that content the assertion of its obligatory character, accompanied by a disincentive for non-compliance. From this perspective legal norms can be syntactically formalized and assigned appropriate semantic values in such terms that they can be incorporated into valid inferential schemes. The consequence is that we can put together legal logics that handle both the phenomenal and the deontic dimensions of legality. (shrink)

The aim of this article is to study the notion of derivability and its semantic counterpart in the context of non-transitive and non-reflexive substructural logics. For this purpose we focus on the study cases of the logics _S__T_ and _T__S_. In this respect, we show that this notion doesn’t coincide, in general, with a nowadays broadly used semantic approach towards metainferential validity: the notion of local validity. Following this, and building on some previous work by Humberstone, we prove (...) that in these systems derivability can be characterized in terms of a notion we call absolute global validity. However, arriving at these results doesn’t lead us to disregard local validity. First, because we discuss the conditions under which local, and also global validity, can be expected to coincide with derivability. Secondly, because we show how taking into account certain families of valuations can be useful to describe derivability for different calculi used to present _S__T_ and _T__S_. (shrink)

ABSTRACT A complete axiomatic system CTLrp is introduced for a temporal logic for finitely branching ω+ -trees in a language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL* into CTLrp. In particular, that yields a complete axiomatization for the translations of all valid CTL*-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantifiers), but in a way more expressive (...) medium for reasoning about branching time. (shrink)

A complete axiomatic system CTL$_{rp}$ is introduced for a temporal logic for finitely branching $\omega^+$-trees in a temporal language extended with so called reference pointers. Syntactic and semantic interpretations are constructed for the branching time computation tree logic CTL$^{*}$ into CTL$_{rp}$. In particular, that yields a complete axiomatization for the translations of all valid CTL$^{*}$-formulae. Thus, the temporal logic with reference pointers is brought forward as a simpler (with no path quantifiers), but in a way more expressive medium (...) for reasoning about branching time. (shrink)

The question “what is an interpretation?” is often intertwined with the perhaps even harder question “what is a scientific theory?”. Given this proximity, we try to clarify the first question to acquire some ground for the latter. The quarrel between the syntactic and semantic conceptions of scientific theories occupied a large part of the scenario of the philosophy of science in the 20th century. For many authors, one of the two currents needed to be victorious. We endorse that (...) such debate, at least in the terms commonly expressed, can be misleading. We argue that the traditional notion of “interpretation” within the syntax/semantic debate is not the same as that of the debate concerning the interpretation of quantum mechanics. As much as the term is the same, the term “interpretation” as employed in quantum mechanics has its meaning beyond (pure) logic. Our main focus here lies on the formal aspects of the solutions to the measurement problem. There are many versions of quantum theory, many of them incompatible with each other. In order to encompass a wider variety of approaches to quantum theory, we propose a different one with an emphasis on pure formalism. This perspective has the intent of elucidating the role of each so-called “interpretation” of quantum mechanics, as well as the precise origin of the need to interpret it. (shrink)

Mathematics textbooks teach logical reasoning by example, a practice started by Euclid; while logic textbooks treat logic as a subject in its own right without practical application to mathematics. Stuck in the middle are students seeking mathematical proficiency and educators seeking to provide it. To assist them, the article explains in practical detail how to teach logic-based skills such as: making mathematical reasoning fully explicit; moving from step to step in a mathematical proof in logically correct ways; and checking to (...) make sure inferences are logically correct. The methodology can easily be extended beyond the four examples analyzed. (shrink)

Definitions I presented in a previous article as part of a semantic approach in epistemology assumed that the concept of derivability from standard logic held across all mathematical and scientific disciplines. The present article argues that this assumption is not true for quantum mechanics (QM) by showing that concepts of validity applicable to proofs in mathematics and in classical mechanics are inapplicable to proofs in QM. Because semantic epistemology must include this important theory, revision is necessary. The one (...) I propose also extends semantic epistemology beyond the ‘hard’ sciences. The article ends by presenting and then refuting some responses QM theorists might make to my arguments. (shrink)

We introduce and study hierarchies of extensions of the propositional modal and temporal languages with pairs of new syntactic devices: point of reference-reference pointer which enable semantic references to be made within a formula. We propose three different but equivalent semantics for the extended languages, discuss and compare their expressiveness. The languages with reference pointers are shown to have great expressive power (especially when their frugal syntax is taken into account), perspicuous semantics, and simple deductive systems. For instance, (...) Kamp's and Stavi's temporal operators, as well as nominals (names, clock variables), are definable in them. Universal validity in these languages is proved undecidable. The basic modal and temporal logics with reference pointers are uniformly axiomatized and a strong completeness theorem is proved for them and extended to some classes of their extensions. (shrink)

John Searle once said: "The Chinese room shows what we knew all along: syntax by itself is not sufficient for semantics. (Does anyone actually deny this point, I mean straight out? Is anyone actually willing to say, straight out, that they think that syntax, in the sense of formal symbols, is really the same as semantic content, in the sense of meanings, thought contents, understanding, etc.?)." I say: "Yes". Stuart C. Shapiro has said: "Does that make any sense? Yes: (...) Everything makes sense. The question is: What sense does it make?" This essay explores what sense it makes to say that syntax by itself is sufficient for semantics. (shrink)

This essay considers what it means to understand natural language and whether a computer running an artificial-intelligence program designed to understand natural language does in fact do so. It is argued that a certain kind of semantics is needed to understand natural language, that this kind of semantics is mere symbol manipulation (i.e., syntax), and that, hence, it is available to AI systems. Recent arguments by Searle and Dretske to the effect that computers cannot understand natural language are discussed, and (...) a prototype natural-language-understanding system is presented as an illustration. (shrink)

This is a reply to the commentaries on my paper 'Truthmaker Semantics for Natural Language: Attitude Verbs, Modals, and Intensional Transitive Verbs'. The paper is a commissioned 'target' article, with commentaries by W. Davis, B. Arsenijevic, K. Moulton, K. Liefke, M. Kaufman, R. Matthews, P. Portner and A. Rubinstein, P. Elliott, and G. Ramchand.

Whether mathematical truths are syntactical (as Rudolf Carnap claimed) or empirical (as Mill actually never claimed, though Carnap claimed that he did) might seem merely an academic topic. However, it becomes a practical concern as soon as we consider the role of questions. For if we inquire as to the truth of a mathematical statement, this question must be (in a certain respect) meaningless for Carnap, as its truth or falsity is certain in advance due to its purely syntactical (or (...) formal-semantical) nature. In contrast, for Mill such a question is as valid as any other. These differing views have their consequences for contemporary erotetic logic. (shrink)

Truth is undefined for imperative statements. However, if imperatives implicitly reference a fact, they can be rephrased as truth­-valuable declaratives explicitly referencing that fact. But are there such facts? Kenny held that any imperative references a set of wishes held by its imperator. I extend his thesis by proposing that imperator wishes are facts implicitly referenced by imperatives and explicitly referencing them yields semantically isomorphic declaratives. I implement this thesis with modal operators for wants and cause with which declarative schemata (...) are formed to automate translation of imperatives into semantically isomorphic declaratives called proxy-­imperatives. The proxy-­imperatives match imperative behavior and provide semantic validation of imperative arguments thereby integrating imperative reasoning into classic truth­-valuable logic. (shrink)

One semantic and two syntactic decision procedures are given for determining the validity of Aristotelian assertoric and apodeictic syllogisms. Results are obtained by using the Aristotelian deductions that necessarily have an even number of premises.

A computer can come to understand natural language the same way Helen Keller did: by using “syntactic semantics”—a theory of how syntax can suffice for semantics, i.e., how semantics for natural language can be provided by means of computational symbol manipulation. This essay considers real-life approximations of Chinese Rooms, focusing on Helen Keller’s experiences growing up deaf and blind, locked in a sort of Chinese Room yet learning how to communicate with the outside world. Using the SNePS computational knowledge-representation (...) system, the essay analyzes Keller’s belief that learning that “everything has a name” was the key to her success, enabling her to “partition” her mental concepts into mental representations of: words, objects, and the naming relations between them. It next looks at Herbert Terrace’s theory of naming, which is akin to Keller’s, and which only humans are supposed to be capable of. The essay suggests that computers at least, and perhaps non-human primates, are also capable of this kind of naming. (shrink)

Aristotle's syllogistic is extended to include denumerably many quantifiers such as 'more than 2/3' and 'exactly 2/3.' Syntactic and semantic decision procedures determine the validity, or invalidity, of syllogisms with any finite number of premises. One of the syntactic procedures uses a natural deduction account of deducibility, which is sound and complete. The semantics for the system is non-classical since sentences may be assigned a value other than true or false. Results about symmetric systems are given. And (...) reasons are given for claiming that syllogistic validity is relevant validity. (shrink)

In “Is semantics possible?” Putnam connected two themes: the very possibility of semantics (as opposed to formal model theory) for natural languages and the proper semantic treatment of common nouns. Putnam observed that abstract semantic accounts are modeled on formal languages model theory: the substantial contribution is rules for logical connectives (given outside the models), whereas the lexicon (individual constants and predicates) is treated merely schematically by the models. This schematic treatment may be all that is needed for (...) an account of validity in a formal setting, but it does not help to understand how proper and common nouns function in reality (not in models). Putnam then initiated the empirical study of such nouns to indicate, (i), that the popular Frege-Carnap account of them as (“disguised” compound) predicates is empirically incorrect, and, (ii), that they offer a new paradigm for a naturalistic semantics of natural languages. We take Putnam’s program a couple of steps further. First, we investigate the semantics of common nouns and argue that they refer (to kinds), rather than apply by satisfaction/truth to a designation/denotation. Second, we point to general results about semantics as a theory whose fulcrum is the reference relation rather than satisfaction in models and validity across them. (shrink)

This thesis considers the following problem: What methods should the epistemology of science use to gain insight into the structure and behaviour of scientific knowledge and method in actual scientific practice? After arguing that the elucidation of epistemological and methodological phenomena in science requires a method that is rooted in formal methods, I consider two alternative methods for epistemology of science. One approach is the classical approaches of the syntactic and semantic views of theories. I show that typical (...) approaches of this sort are inadequate and inaccurate in their representation of scientific knowledge by showing how they fail to account for and misrepresent important epistemological structure and behaviour in science. The other method for epistemology of science I consider is modeled on the methods used to construct valid models of natural phenomena in applied mathematics. This new epistemological method is itself a modeling method that is developed through the detailed consideration of two main examples of theory application in science: double pendulum systems and the modeling of near-Earth objects to compute probability of future Earth impact. I show that not only does this new method accurately represent actual methods used to apply theories in applied mathematics, it also reveals interesting structural and behavioural patterns in the application process and gives insight into what underlies the stability of methods of application. I therefore conclude that for epistemology of science to develop fully as a scientific discipline it must use methods from applied mathematics, not only methods from pure mathematics and metamathematics as traditional formal epistemology of science has done. (shrink)

We provide a direct method for proving Craig interpolation for a range of modal and intuitionistic logics, including those containing a "converse" modality. We demonstrate this method for classical tense logic, its extensions with path axioms, and for bi-intuitionistic logic. These logics do not have straightforward formalisations in the traditional Gentzen-style sequent calculus, but have all been shown to have cut-free nested sequent calculi. The proof of the interpolation theorem uses these calculi and is purely syntactic, without resorting to (...) embeddings, semantic arguments, or interpreted connectives external to the underlying logical language. A novel feature of our proof includes an orthogonality condition for defining duality between interpolants. (shrink)

A generative grammar for a language L generates one or more syntactic structures for each sentence of L and interprets those structures both phonologically and semantically. A widely accepted assumption in generative linguistics dating from the mid-60s, the Generative Grammar Hypothesis , is that the ability of a speaker to understand sentences of her language requires her to have tacit knowledge of a generative grammar of it, and the task of linguistic semantics in those early days was taken to (...) be that of specifying the form that the semantic component of a generative grammar must take. Then in the 70s linguistic semantics took a curious turn. Without rejecting GGH, linguists turned away from the task of characterizing the semantic component of a generative grammar to pursue instead the Montague-inspired project of providing for natural languages the same kind of model-theoretic semantics that logicians devise for the artificial languages of formal systems of logic, and “formal semantics” continues to dominate semantics in linguistics. This essay argues that the sort of compositional meaning theory that would verify GGH would not only be quite different from the theories formal semanticists construct, but would be a more fundamental theory that supersedes those theories in that it would explain why they are true when they are true, but their truth wouldn’t explain its truth. Formal semantics has undoubtedly made important contributions to our understanding of such phenomena as anaphora and quantification, but semantics in linguistics is supposed to be the study of meaning. This means that the formal semanticist can’t be unconcerned that the kind of semantic theory for a natural language that interests her has no place in a theory of linguistic competence; for if GGH is correct, then the more fundamental semantic theory is the compositional meaning theory that is the semantic component of the internally represented generative grammar, and if that is so, then linguistic semantics has so far ignored what really ought to be its primary concern. (shrink)

Mark Schroeder’s expressivist program has made substantial progress in providing a compositional semantics for normative terms. This paper argues that it risks achieving this semantic progress at the cost of abandoning a key theoretical motivation for embracing expressivism in the first place. The problem can be summarized as a dilemma. Either Schroeder must allow that there are cases in which agents are in disagreement with one another, or can make valid inferences, but that these disagreements or inferences are not (...) expressible in natural language; or his version of expressivism must abandon one of the key theoretical advantages expressivist theories seemed to possess over cognitivism, the ability to provide a very straightforward explanation of the action- and attitude-guiding role of normative judgments. (shrink)

I use the principle of truth-maker maximalism to provide a new solution to the semantic paradoxes. According to the solution, AUS, its undecidable whether paradoxical sentences are grounded or ungrounded. From this it follows that their alethic status is undecidable. We cannot assert, in principle, whether paradoxical sentences are true, false, either true or false, neither true nor false, both true and false, and so on. AUS involves no ad hoc modification of logic, denial of the T-schema's validity, or (...) obvious revenge. (shrink)

Semantic information is usually supposed to satisfy the veridicality thesis: p qualifies as semantic information only if p is true. However, what it means for semantic information to be true is often left implicit, with correspondentist interpretations representing the most popular, default option. The article develops an alternative approach, namely a correctness theory of truth (CTT) for semantic information. This is meant as a contribution not only to the philosophy of information but also to the philosophical (...) debate on the nature of truth. After the introduction, in Sect. 2, semantic information is shown to be translatable into propositional semantic information (i). In Sect. 3, i is polarised into a query (Q) and a result (R), qualified by a specific context, a level of abstraction and a purpose. This polarization is normalised in Sect. 4, where [Q + R] is transformed into a Boolean question and its relative yes/no answer [Q + A]. This completes the reduction of the truth of i to the correctness of A. In Sects. 5 and 6, it is argued that (1) A is the correct answer to Q if and only if (2) A correctly saturates Q by verifying and validating it (in the computer science’s sense of “verification” and “validation”); that (2) is the case if and only if (3) [Q + A] generates an adequate model (m) of the relevant system (s) identified by Q; that (3) is the case if and only if (4) m is a proxy of s (in the computer science’s sense of “proxy”) and (5) proximal access to m commutes with the distal access to s (in the category theory’s sense of “commutation”); and that (5) is the case if and only if (6) reading/writing (accessing, in the computer science’s technical sense of the term) m enables one to read/write (access) s. Sect. 7 provides some further clarifications about CTT, in the light of semantic paradoxes. Section 8 draws a general conclusion about the nature of CTT as a theory for systems designers not just systems users. In the course of the article all technical expressions from computer science are explained. (shrink)

There is a prevalent notion among cognitive scientists and philosophers of mind that computers are merely formal symbol manipulators, performing the actions they do solely on the basis of the syntactic properties of the symbols they manipulate. This view of computers has allowed some philosophers to divorce semantics from computational explanations. Semantic content, then, becomes something one adds to computational explanations to get psychological explanations. Other philosophers, such as Stephen Stich, have taken a stronger view, advocating doing away (...) with semantics entirely. This paper argues that a correct account of computation requires us to attribute content to computational processes in order to explain which functions are being computed. This entails that computational psychology must countenance mental representations. Since anti-semantic positions are incompatible with computational psychology thus construed, they ought to be rejected. Lastly, I argue that in an important sense, computers are not formal symbol manipulators. (shrink)

Semantic information is usually supposed to satisfy the veridicality thesis: p qualifies as semantic information only if p is true. However, what it means for semantic information to be true is often left implicit, with correspondentist interpretations representing the most popular, default option. The article develops an alternative approach, namely a correctness theory of truth (CTT) for semantic information. This is meant as a contribution not only to the philosophy of information but also to the philosophical (...) debate on the nature of truth. After the introduction, in Sect. 2, semantic information is shown to be translatable into propositional semantic information (i). In Sect. 3, i is polarised into a query (Q) and a result (R), qualified by a specific context, a level of abstraction and a purpose. This polarization is normalised in Sect. 4, where [Q + R] is transformed into a Boolean question and its relative yes/no answer [Q + A]. This completes the reduction of the truth of i to the correctness of A. In Sects. 5 and 6, it is argued that (1) A is the correct answer to Q if and only if (2) A correctly saturates Q by verifying and validating it (in the computer science’s sense of verification and validation ); that (2) is the case if and only if (3) [Q + A] generates an adequate model (m) of the relevant system (s) identified by Q; that (3) is the case if and only if (4) m is a proxy of s (in the computer science’s sense of proxy ) and (5) proximal access to m commutes with the distal access to s (in the category theory’s sense of commutation ); and that (5) is the case if and only if (6) reading/writing (accessing, in the computer science’s technical sense of the term) m enables one to read/write (access) s. Sect. 7 provides some further clarifications about CTT, in the light of semantic paradoxes. Section 8 draws a general conclusion about the nature of CTT as a theory for systems designers not just systems users. In the course of the article all technical expressions from computer science are explained. (shrink)

In this paper, I claim that two ways of defining validity for modal languages (“real-world” and “general” validity), corresponding to distinction between a correct and an incorrect way of defining modal valid- ity, correspond instead to two substantive ways of conceiving modal truth. At the same time, I claim that the major logical manifestation of the real- world/general validity distinction in modal propositional languages with the actuality operator should not be taken seriously, but simply as a by-product of the way (...) in which the semantics of such an operator is usually given. (shrink)

What makes a valid argument valid? Generally speaking, in a valid argument, if the premisses are true, then the conclusion must necessarily also be true. But on its own, this doesn’t tell us all that much. What is truth? And what is necessity? In what follows, I consider answers to these questions proposed by the fourteenth century logician John Buridan († ca. 1358). My central claim is that Buridan’s logic is downstream from his metaphysics. Accordingly, I treat his metaphysical discussions (...) as the key to his logic. As has been often noted, Buridan’s metaphysics are radically anti-realist about universals, though I think the depth and scope of his anti-realism has at times been papered over. Buridan constructs his logic on an amazingly spartan ontology, and this accomplishment is overdue for reconsideration. To the foregoing questions: truth is a feature of propositions, and of propositions only—not of proposition-like states of affairs, or anything like that. It is a function of the reference or supposition (suppositio) of their terms, which depends on predication in a propositional context. And necessary truth is grounded in causation: a predication is necessary if it cannot be falsified by any power, natural or supernatural, without ii annihilating what its terms stand for. “Socrates is a human”, for instance, can only be falsified by annihilating Socrates, and so it is a necessary truth. -/- These considerations provide an ample theoretical basis for a thorough examination of Buridan’s modal logic. This is what the thesis culminates with. In the final chapter, I set forth some novel and surprising findings, chief of which is this: Buridan’s modal syntax and semantics are nothing like Kripke’s—and indeed are incompatible with them. This has significant implications not only for modal logic and metaphysics, but for how we think about medieval logic and philosophy more generally. -/- Throughout the thesis, I advocate a methodology of emphasising the differences, rather than the similarities, between past and present thought. Buridan is wildly unlike what we’re used to, and we should let him speak for himself. (shrink)

According to the philosophical tradition, translation is successful when one has substituted words and sentences from one language with those from another by cross-linguistic synonymy. Moreover, according to the orthodox view, the meaning of expressions and sentences of languages are determined by their basic or systematic role in a language. This makes translating normative and evaluative discourse puzzling for two reasons. First, as languages are syntactically and semantically different because of their peculiar cultural and historical influences, and as values and (...) norms differ across cultures, it is unlikely that languages will have synonymous evaluative and normative expressions. If translation is only successful by cross-linguistic synonymy, it would seem that we will not be able to translate the value theoretic claims of persons from radically different cultures. But it is with such persons that dialogue on evaluative matters is imperative, to resolve ethical and axiological differences that could be the root of conflict. Second, as the orthodox account of meaning renders it linguistically relative, it is unlikely that expressions across languages will be cross-linguistically synonymous. Thus, on the Orthodox account of translation, translation is indeterminate (as W.V.O. Quine has argued) or impossible (as Jacques Derrida has argued). In this dissertation I argue for a novel theory of meaning and translation based on innovations in the translation studies literature and my prior work in cross cultural research, which I call Text-Type Semantics or TTS. TTS explains how translation is successful while affirming radical cultural and linguistic diversity. It treats disciplinary concerns as the neutral criteria to calibrate translation. On the basis of TTS I argue that we need what I call the “Quasi-Indexical” account of thick and thin concepts (or QI) to translate normative and evaluative discourse. I argue that QI and TTS succeed where competing accounts in the moral semantics literature (such as Non-Analytic Naturalism and Expressivism) fail. The argument also shows that the relativization of truth (in philosophy and beyond) to languages and cultures is mistaken. (shrink)

An attractive way to model the relation between an underspecified syntactic representation and its completions is to let the underspecified representation correspond to a logical description and the completions to the models of that description. This approach, which underlies the Description Theory of Marcus et al. 1983 has been integrated in Vijay-Shanker 1992 with a pure unification approach to Lexicalized Tree-Adjoining Grammars (Joshi et al. 1975, Schabes 1990). We generalize Description Theory by integrating semantic information, that is, we (...) propose to tackle both syntactic and semantic underspecification using descriptions. (shrink)

Quantification, Negation, and Focus: Challenges at the Conceptual-Intentional Semantic Interface Tista Bagchi National Institute of Science, Technology, and Development Studies (NISTADS) and the University of Delhi Since the proposal of Logical Form (LF) was put forward by Robert May in his 1977 MIT doctoral dissertation and was subsequently adopted into the overall architecture of language as conceived under Government-Binding Theory (Chomsky 1981), there has been a steady research effort to determine the nature of LF in language in light of (...) structurally diverse languages around the world, which has ultimately contributed to the reinterpretation of LF as a Conceptual-Intentional (C-I) interface level between the computational syntactic component of the faculty of language and one or more interpretive faculties of the human mind. While this has opened up further possibilities of research in phenomena such as quantifier scope and scope interactions between negation, quantification, and focus, it has also given rise to a few real challenges to linguistic theory as well. Some of these are: (i) the split between lexical meaning – a matter supposedly belonging to the phase-wise selection of lexical arrays – and issues of semantic interpretation that arise purely from binding and scope phenomena (Mukherji 2010); (ii) partially relatedly, the level at which theta role assignment can be argued to take place, an issue that is taken up by me in Bagchi (2007); and (iii) how supposedly “pure” scopal phenomena relating to quantifiers, negation, and emphasizing expressions such as only and even (comparable to, e.g., Urdu/Hindi hii and bhii, Bangla –i and –o) also have dimensions of both focus and discourse reference. While recognizing all of these challenges, this talk aims to highlight particularly challenge (iii), both in terms of scholarship in the past and for the rich prospects for research on languages of south Asia with the semantics of quantification, negation, and focus in view. The scholarship of the past that I seek to relate this issue to is where, parallel to (and largely independently of) the research on LF that had been happening, Barwise and Cooper were developing their influential view of noun phrases as generalized quantifiers, culminating in their key 1981 article “Generalized Quantifiers and Natural Language” while, independently, McCawley, in his 1981 book Everything that Linguists have Always Wanted to Know about Logic, established through argumentation that all noun phrases semantically behave like generalized quantified expressions (further elaborated by him in the second – 1994 – revised edition of his book). I seek to demonstrate, based on limited data analysis from selected languages of south Asia, that our current understanding of quantification, negation, and focus under the Minimalist view owes something significant to the two major, but now largely marginalized, works of scholarship, and that for the way forward it is essential to adopt a more formal-semantic approach as adopted by them and also by later works such as Denis Bouchard’s (1995) The Semantics of Syntax, Mats Rooth’s work on focus (e.g., Rooth 1996, “Focus” in Shalom Lappin’s Handbook of Contemporary Semantic Theory), Heim and Kratzer’s Semantics in Generative Grammar (1998), and Yoad Winter’s (2002) Linguistic Inquiry article on semantic number, to cite just a few instances. (shrink)

Although the view that sees proper names as referential singular terms is widely considered orthodoxy, there is a growing popularity to the view that proper names are predicates. This is partly because the orthodoxy faces two anomalies that Predicativism can solve: on the one hand, proper names can have multiple bearers. But multiple bearerhood is a problem to the idea that proper names have just one individual as referent. On the other hand, as Burge noted, proper names can have predicative (...) uses. But the view that proper names are singular terms arguably does not have the resources to deal with Burge’s cases. In this paper I argue that the Predicate View of proper names is mistaken. I first argue against the syntactic evidence used to support the view and against the predicativist’s methodology of inferring a semantic account for proper names based on incomplete syntactic data. I also show that Predicativism can neither explain the behaviour of proper names in full generality, nor claim the fundamentality of predicative names. In developing my own view, however, I accept the insight that proper names in some sense express generality. Hence I propose that proper names—albeit fundamentally singular referential terms—express generality in two senses. First, by being used as predicates, since then they are true of many individuals; and second, by being referentially related to many individuals. I respond to the problem of multiple bearerhood by proposing that proper names are polyreferential, and also explain the behaviour of proper names in light of the wider phenomenon I called category change, and show how Polyreferentialism can account for all uses of proper names. (shrink)

Is it possible to give a justification of our own practice of deductive inference? The purpose of this paper is to explain what such a justification might consist in and what its purpose could be. On the conception that we are going to pursue, to give a justification for a deductive practice means to explain in terms of an intuitively satisfactory notion of validity why the inferences that conform to the practice coincide with the valid ones. That is, a justification (...) should provide an analysis of the notion of validity and show that the inferences that conform to the practice are just the ones that are valid. Moreover, a complete justification should also explain the purpose, or point, of our inferential practice. We are first going to discuss the objection that any justification of our deductive practice must use deduction and therefore be circular. Then we will consider a particular model of justificatory explanation, building on Georg Kreisel’s concept of informal rigour. Finally, in the main part of the paper, we will discuss three ideas for defining the notion of validity: (i) the classical conception according to which the notion of (bivalent) truth is taken as basic and validity is defined in terms of the preservation of truth; (ii) the constructivist idea of starting instead with the notion of (a canonical) proof (or verification) and define validity in terms of this notion; (iii) the idea of taking the notions of rational acceptance and rejection as given and define an argument to be valid just in case it is irrational to simultaneously accept its premises and reject its conclusion (or conclusions, if we allow for multiple conclusions). Building on work by Dana Scott, we show that the last conception may be viewed as being, in a certain sense, equivalent to the first one. Finally, we discuss the so-called paradox of inference and the informativeness of deductive arguments. (shrink)

In this paper we discuss a new perspective on the syntax-semantics interface. Semantics, in this new set-up, is not ‘read off’ from Logical Forms as in mainstream approaches to generative grammar. Nor is it assigned to syntactic proofs using a Curry-Howard correspondence as in versions of the Lambek Calculus, or read off from f-structures using Linear Logic as in Lexical-Functional Grammar (LFG, Kaplan & Bresnan [9]). All such approaches are based on the idea that syntactic objects (trees, proofs, (...) fstructures) are somehow prior and that semantics must be parasitic on those syntactic objects. We challenge this idea and develop a grammar in which syntax and semantics are treated in a strictly parallel fashion. The grammar will have many ideas in common with the (converging) frameworks of categorial grammar and LFG, but its treatment of the syntax-semantics interface is radically different. Also, although the meaning component of the grammar is a version of Montague semantics and although there are obvious affinities between Montague’s conception of grammar and the work presented here, the grammar is not compositional, in the sense that composition of meaning need not follow surface structure. (shrink)

Corcoran, J. 2007. Syntactics, American Philosophy: an Encyclopedia. 2007. Eds. John Lachs and Robert Talisse. New York: Routledge. pp.745-6. -/- Syntactics, semantics, and pragmatics are the three levels of investigation into semiotics, or the comprehensive study of systems of communication, as described in 1938 by the American philosopher Charles Morris (1903-1979). Syntactics studies signs themselves and their interrelations in abstraction from their meanings and from their uses and users. Semantics studies signs in relation to their meanings, but still in abstraction (...) from their uses and users. Pragmatics studies signs as meaningful entities used in various ways by humans. Taking current written English as the system of communication under investigation, it is a matter of syntactics that the two four-character strings ‘tact’ and ‘tics’ both occur in the ten-character string ‘syntactics’. It is a matter of semantics that the ten-character string ‘syntactics’ has only one sense and, in that sense, it denotes a branch of semiotics. It is a matter of pragmatics that the ten-character string ‘syntactics’ was not used as an English word before 1937 and that it is sometimes confused with the much older six-character string ‘syntax’. Syntactics is the simplest and most abstract branch of semiotics. At the same time, it is the most basic. Pragmatics presupposes semantics and syntactics; semantics presupposes syntactics. The basic terms of syntactics include the following: ‘character’ as alphabetic letters, numeric digits, and punctuation marks; ‘string’ as sign composed of a concatenation of characters; ‘occur’ as ‘t’ and ‘c’ both occur twice in ‘syntactics’. However, perhaps the most basic terms of syntactics are ‘type’ and ‘token’ in the senses introduced by Charles Sanders Peirce (1839-1914), America’s greatest logician, who could be considered the grandfather of syntactics, if not the father. These are explained below. (shrink)

In the paper, original formal-logical conception of syntactic and semantic: intensional and extensional senses of expressions of any language L is outlined. Syntax and bi-level intensional and extensional semantics of language L are characterized categorically: in the spirit of some Husserl’s ideas of pure grammar, Leśniewski-Ajukiewicz’s theory syntactic/semantic categories and in accordance with Frege’s ontological canons, Bocheński’s famous motto—syntax mirrors ontology and some ideas of Suszko: language should be a linguistic scheme of ontological reality and simultaneously (...) a tool of its cognition. In the logical conception of language L, its expressions should satisfy some general conditions of language adequacy. The adequacy ensures their unambiguous syntactic and semantic senses and mutual, syntactic, and semantic compatibility, correspondence guaranteed by the acceptance of a postulate of categorial compatibility syntactic and semantic categories of expressions of L. From this postulate, three principles of compositionality follow: one syntactic and two semantic already known to Frege. They are treated as conditions of homomorphism partial algebra of L into algebraic models of L: syntactic, intensional, and extensional. In the paper, they are applied to some expressions with quantifiers. Language adequacy connected with the logical senses described in the logical conception of language L is, of course, an idealization, but only expressions with high degrees of precision of their senses, after due justification, may become theorems of science. (shrink)

The expression conditional fallacy identifies a family of arguments deemed to entail odd and false consequences for notions defined in terms of counterfactuals. The antirealist notion of truth is typically defined in terms of what a rational enquirer or a community of rational enquirers would believe if they were suitably informed. This notion is deemed to entail, via the conditional fallacy, odd and false propositions, for example that there necessarily exists a rational enquirer. If these consequences do indeed follow from (...) the antirealist notion of truth, alethic antirealism should probably be rejected. In this paper we analyse the conditional fallacy from a semantic (i.e. model-theoretic) point of view. This allows us to identify with precision the philosophical commitments that ground the validity of this type of argument. We show that the conditional fallacy arguments against alethic antirealism are valid only if controversial metaphysical assumptions are accepted. We suggest that the antirealist is not committed to the conditional fallacy because she is not committed to some of these assumptions. (shrink)

Prawitz conjectured that proof-theoretic validity offers a semantics for intuitionistic logic. This conjecture has recently been proven false by Piecha and Schroeder-Heister. This article resolves one of the questions left open by this recent result by showing the extensional alignment of proof-theoretic validity and general inquisitive logic. General inquisitive logic is a generalisation of inquisitive semantics, a uniform semantics for questions and assertions. The paper further defines a notion of quasi-proof-theoretic validity by restricting proof-theoretic validity to allow double negation elimination (...) for atomic formulas and proves the extensional alignment of quasi-proof-theoretic validity and inquisitive logic. (shrink)

SEMANTIC ARITHMETIC: A PREFACE John Corcoran Abstract Number theory, or pure arithmetic, concerns the natural numbers themselves, not the notation used, and in particular not the numerals. String theory, or pure syntax, concems the numerals as strings of «uninterpreted» characters without regard to the numbe~s they may be used to denote. Number theory is purely arithmetic; string theory is purely syntactical... in so far as the universe of discourse alone is considered. Semantic arithmetic is a broad subject which (...) begins when numerals are mentioned (not just used) and mentioned as names of numbers (not just as syntactic objects). Semantic arithmetic leads to many fascinating and surprising algorithms and decision procedures; it reveals in a vivid way the experiential import of mathematical propositions and the predictive power of mathematical knowledge; it provides an interesting perspective for philosophical, historical, and pedagogical studies of the growth of scientific knowledge and of the role metalinguistic discourse in scientific thought. (shrink)

Artificial agents are commonly described by using words that traditionally belong to the semantic field of organisms, particularly of animal and human life. I call this phenomenon the game of semantic extension. However, the semantic extension of words as crucial as “autonomous”, “intelligent”, “creative”, “moral”, and so on, is often perceived as unsatisfactory, which is signalled with the extensive use of inverted commas or other syntactical cues. Such practice, in turn, has provoked harsh criticism that usually refers (...) back to the literal meaning of the words to show their inappropriateness in describing artificial agents. Hence the question: how can we choose our words appropriately and wisely while making sense of artificial agents? After a brief introduction (§1), in §2 I present the starting point of my argument, which consists in the assumption that the dimensions of technology and language are deeply entangled. In §3 I discuss how this assumption impinges on the issue of choosing the right words to talk about artificial agents. §4 is an exposition of the main features of the game of semantic extension, while §5 reviews the related opportunities and risks. Finally, §6 elaborates some practical suggestions on how to play the game well. (shrink)

Thomas Hofweber takes the semantic paradoxes to motivate a radical reconceptualization of logical validity, rejecting the idea that an inference rule is valid just in case every instance thereof is necessarily truth-preserving. Rather than this “strict validity”, we should identify validity with “generic validity”, where a rule is generically valid just in case its instances are truth preserving, and where this last sentence is a generic, like “Bears are dangerous”. While sympathetic to Hofweber’s view that strict validity should be (...) replaced by something allowing for exceptions, I argue that this should instead be truth-conduciveness, a matter of a large majority of instances being truth-preserving. The fact that inference rules have uncountably many instances, I argue, can be handled by defining truth-conduciveness as relative to finite sets of instances. Moreover, I argue that Hofweber’s position, while seemingly radical, may be less so under closer scrutiny. For the mere claim that classical rules and unrestricted truth rules are generically valid (or truth-conducive) is not in itself controversial. Also, if there is an answer to the question of which of these are also strictly valid, then the claim that generic validity is the central notion in logic is at most an interest-relative matter, since there is then also a fact of the matter as to which inference rules are (not) strictly valid. If no solution operating with strict validity to the paradoxes can be had, however, then the claim that validity should be identified with a weaker notion is better motivated. I argue that it is reasonable, in view of past failures, to conjecture that no ordinary solution will score high enough relative to standard (uncontroversial) desiderata to merit justified belief. Hence, it is unknowable which solution is correct. I further argue that this is best explained by its being metaphysically indeterminate which solution is correct. If this conjecture is true, then we ought instead to think of validity as allowing exceptions, and then take the “true logic” to be one that takes both the classical rules and the truth rules to be valid, i.e., truth-conducive. This logic scores very high on the desiderata on logics, and is therefore preferable to any logic operating with strict validity. (shrink)

It is one thing for a given proposition to follow or to not follow from a given set of propositions and it is quite another thing for it to be shown either that the given proposition follows or that it does not follow.* Using a formal deduction to show that a conclusion follows and using a countermodel to show that a conclusion does not follow are both traditional practices recognized by Aristotle and used down through the history of logic. These (...) practices presuppose, respectively, a criterion of validity and a criterion of invalidity each of which has been extended and refined by modern logicians: deductions are studied in formal syntax (proof theory) and coun¬termodels are studied in formal semantics (model theory). The purpose of this paper is to compare these two criteria to the corresponding criteria employed in Boole’s first logical work, The Mathematical Analysis of Logic (1847). In particular, this paper presents a detailed study of the relevant metalogical passages and an analysis of Boole’s symbolic derivations. It is well known, of course, that Boole’s logical analysis of compound terms (involving ‘not’, ‘and’, ‘or’, ‘except’, etc.) contributed to the enlargement of the class of propositions and arguments formally treatable in logic. The present study shows, in addition, that Boole made significant contributions to the study of deduc¬tive reasoning. He identified the role of logical axioms (as opposed to inference rules) in formal deductions, he conceived of the idea of an axiomatic deductive sys¬tem (which yields logical truths by itself and which yields consequences when ap¬plied to arbitrary premises). Nevertheless, surprisingly, Boole’s attempt to imple¬ment his idea of an axiomatic deductive system involved striking omissions: Boole does not use his own formal deductions to establish validity. Boole does give symbolic derivations, several of which are vitiated by “Boole’s Solutions Fallacy”: the fallacy of supposing that a solution to an equation is necessarily a logical consequence of the equation. This fallacy seems to have led Boole to confuse equational calculi (i.e., methods for gen-erating solutions) with deduction procedures (i.e., methods for generating consequences). The methodological confusion is closely related to the fact, shown in detail below, that Boole had adopted an unsound criterion of validity. It is also shown that Boole totally ignored the countermodel criterion of invalid¬ity. Careful examination of the text does not reveal with certainty a test for invalidity which was adopted by Boole. However, we have isolated a test that he seems to use in this way and we show that this test is ineffectual in the sense that it does not serve to identify invalid arguments. We go beyond the simple goal stated above. Besides comparing Boole’s earliest criteria of validity and invalidity with those traditionally (and still generally) employed, this paper also investigates the framework and details of THE MATHEMATICAL ANALYSIS OF LOGIC. (shrink)

The book argues for Plural Reference for the semantics of natural language and makes the connection between Plural Reference and Alternative Semantics for the purpose of the interpretation of three-dimensional syntactic structures of coordinate sentences (in the sense of my 1992 MIT Ph D thesis).

This paper attempts to locate modern Zen and psychoanalysis in terms of contemporary philosophy of mind, particularly in view of dominant theories of cognitivism that see the mind as informational and material, with meaning being mere information in disguise. Psychoanalysis and modern Zen hold to the contrary view that the mind is “semantic,” not “syntactic,” and that the meanings we have in our heads are not reducible to the physical informational processes from which they have emerged. Meaning, as (...) non-reducible, is infinite and uncaused. However, the structure of meaning entails a split between a knower and what is known. This split creates problems in the mind which can be confronted through more, not less, engagement with the meanings in our minds, until we are self-aware and, perhaps, self-identical, with the mechanisms of consciousness that produce the meanings in our head. Such self-awareness is seen as being self-liberating rather than self-reducing. (shrink)

This paper will outline a novel semantics of verbs of saying and of quotation based on Austin’s (1962) distinction among levels of linguistic acts (illocutionary, locutionary, rhetic, phatic, and phonetic acts). It will propose a way of understanding the notion of a rhetic act and argue that it is well-reflected in the semantics of natural language. The paper will furthermore outline a novel, unified and compositional semantics of quotation which is guided by two ideas. First, quotations convey properties related to (...) lower-level (phonetic or phatic) linguistic acts; second, such meanings of quotations are strictly based on syntactic structure, namely a lower-level (phonetic, phonological or morpho-syntactic) structure as part of the syntactic structure that is input to semantic interpretation. Such lower-level linguistic structures will contribute properties of utterances, to the semantic composition of the sentence, in one way or another. (shrink)

In a previous work we introduced the algorithm \SQEMA\ for computing first-order equivalents and proving canonicity of modal formulae, and thus established a very general correspondence and canonical completeness result. \SQEMA\ is based on transformation rules, the most important of which employs a modal version of a result by Ackermann that enables elimination of an existentially quantified predicate variable in a formula, provided a certain negative polarity condition on that variable is satisfied. In this paper we develop several extensions of (...) \SQEMA\ where that syntactic condition is replaced by a semantic one, viz. downward monotonicity. For the first, and most general, extension \SSQEMA\ we prove correctness for a large class of modal formulae containing an extension of the Sahlqvist formulae, defined by replacing polarity with monotonicity. By employing a special modal version of Lyndon's monotonicity theorem and imposing additional requirements on the Ackermann rule we obtain restricted versions of \SSQEMA\ which guarantee canonicity, too. (shrink)

We present an overview of typed and untyped disquotational truth theories with the emphasis on their (non)conservativity over the base theory of syntax. Two types of conservativity are discussed: syntactic and semantic. We observe in particular that TB—one of the most basic disquotational theories—is not semantically conservative over its base; we show also that an untyped disquotational theory PTB is a syntactically conservative extension of Peano Arithmetic.

In terms of validity in Kripke frames, a modal formula expresses a universal monadic second-order condition. Those modal formulae which are equivalent to first-order conditions are called elementary. Modal formulae which have a certain persistence property which implies their validity in all canonical frames of modal logics axiomatized with them, and therefore their completeness, are called canonical. This is a survey of a recent and ongoing study of the class of elementary and canonical modal formulae. We summarize main ideas and (...) results, and outline further research perspectives. (shrink)

Beall and Murzi :143–165, 2013) introduce an object-linguistic predicate for naïve validity, governed by intuitive principles that are inconsistent with the classical structural rules. As a consequence, they suggest that revisionary approaches to semantic paradox must be substructural. In response to Beall and Murzi, Field :1–19, 2017) has argued that naïve validity principles do not admit of a coherent reading and that, for this reason, a non-classical solution to the semantic paradoxes need not be substructural. The aim of (...) this paper is to respond to Field’s objections and to point to a coherent notion of validity which underwrites a coherent reading of Beall and Murzi’s principles: grounded validity. The notion, first introduced by Nicolai and Rossi, is a generalisation of Kripke’s notion of grounded truth, and yields an irreflexive logic. While we do not advocate the adoption of a substructural logic, we take the notion of naïve validity to be a legitimate semantic notion that points to genuine expressive limitations of fully structural revisionary approaches. (shrink)

This work explores the hypothesis that subjectively attributed meaning constitutes the phenomenal content of conscious experience. That is, phenomenal content is semantic. This form of subjective meaning manifests as an intrinsic and non-representational character of qualia. Empirically, subjective meaning is ubiquitous in conscious experiences. We point to phenomenological studies that lend evidence to support this. Furthermore, this notion of meaning closely relates to what Frege refers to as "sense", in metaphysics and philosophy of language. It also aligns with Peirce's (...) "interpretant", in semiotics. We discuss how Frege's sense can also be extended to the raw feels of consciousness. Sense and reference both play a role in phenomenal experience. Moreover, within the context of the mind-matter relation, we provide a formalization of subjective meaning associated to one's mental representations. Identifying the precise maps between the physical and mental domains, we argue that syntactic and semantic structures transcend language, and are realized within each of these domains. Formally, meaning is a relational attribute, realized via a map that interprets syntactic structures of a formal system within an appropriate semantic space. The image of this map within the mental domain is what is relevant for experience, and thus comprises the phenomenal content of qualia. We conclude with possible implications this may have for experience-based theories of consciousness. (shrink)