Was ist Natur oder was könnte sie sein? Diese und weitere Fragen sind grundlegend für Naturdenken und -handeln. Das Lehr- und Studienbuch bietet eine historisch-systematische und zugleich praxisbezogene Einführung in die Naturphilosophie mit ihren wichtigsten Begriffen. Es nimmt den pluralen Charakter der Wahrnehmung von Natur in den philosophischen Blick und ist auch zum Selbststudium bestens geeignet.

The desideratum of semantic interoperability has been intensively discussed in medical informatics circles in recent years. Originally, experts assumed that this issue could be sufficiently addressed by insisting simply on the application of shared clinical terminologies or clinical information models. However, the use of the term ‘ontology’ has been steadily increasing more recently. We discuss criteria for distinguishing clinical ontologies from clinical terminologies and information models. Then, we briefly present the role clinical ontologies play in two multicentric research projects. Finally, (...) we discuss the interactions between these different kinds of knowledge representation artifacts and the stakeholders involved in developing interoperational real-world clinical applications. We provide ontology engineering examples from two EU-funded projects. (shrink)

Statements about the behavior of biochemical entities (e.g., about the interaction between two proteins) abound in the literature on molecular biology and are increasingly becoming the targets of information extraction and text mining techniques. We show that an accurate analysis of the semantics of such statements reveals a number of ambiguities that have to be taken into account in the practice of biomedical ontology engineering: Such statements can not only be understood as event reporting statements, but also as ascriptions of (...) dispositions or tendencies that may or may not refer to collectives of interacting molecules or even to collectives of interaction events. (shrink)

Propomos uma tipologia dos artefatos de representação para as áreas de saúde e ciências biológicas, e a associação dessa tipologia com diferentes tipos de ontologia formal e lógica, chegando a conclusões quanto aos pontos fortes e limitações da ontologia de diferentes tipos de recursos lógicos, enquanto mantemos o foco na lógica descritiva. Consideramos quatro tipos de representação de área: (i) representação léxico-semântica, (ii) representação de tipos de entidades, (iii) representação de conhecimento prévio, e (iv) representação de indivíduos. Defendemos uma clara (...) distinção entre os quatro tipos de representação, de forma a oferecer uma base mais racional para o uso das ontologias e artefatos relacionados no avanço da integração de dados e interoperabilidade de sistemas de raciocínio associados. Destacamos que apenas uma pequena porção de fatos cientificamente relevantes em áreas como a biomedicina pode ser adequadamente representada por ontologias formais, quando estas últimas são concebidas como representações de tipos de entidades. Particularmente, a tentativa de codificar conhecimento padrão ou probabilístico pela utilização de ontologias assim concebidas é fadada à produção de modelos não intencionais e errôneos. (shrink)

The desideratum of semantic interoperability has been intensively discussed in medical informatics circles in recent years. Originally, experts assumed that this issue could be sufficiently addressed by insisting simply on the application of shared clinical terminologies or clinical information models. However, the use of the term ‘ontology’ has been steadily increasing more recently. We discuss criteria for distinguishing clinical ontologies from clinical terminologies and information models. Then, we briefly present the role clinical ontologies play in two multicentric research projects. Finally, (...) we discuss the interactions between these different kinds of knowledge representation artifacts and the stakeholders involved in developing interoperational real-world clinical applications. We provide ontology engineering examples from two EU-funded projects. (shrink)

This essay articulates and defends Aristotle’s argument in Politics 7.4 that there is a rational limit to the size of the political community. Aristotle argues that size can negatively affect the ability of an organized being to attain its proper end. After examining the metaphysical grounds for this principle in both natural beings and artifacts, we defend Aristotle’s extension of the principle to the polis. He argues that the state is in the relevant sense an organism, one whose primary end (...) is to make good reasons available to individuals and promote them as choiceworthy. The size of a polis can affect its ability to perform this function, since growth promotes anonymity among citizens, which in turn frustrates the familiarity between citizens required for the exercise of distributive and restorative justice as well as political prudence. This paper suggests several ways in which Aristotle’s argument, if sound, is important for contemporary issues in moral psychology, Ralwsian political philosophy, and big data analytics. (shrink)

I develop a distinction between two types of psychological hedonism. Inferential hedonism (or “I-hedonism”) holds that each person only has ultimate desires regarding his or her own hedonic states (pleasure and pain). Reinforcement hedonism (or “R–hedonism”) holds that each person's ultimate desires, whatever their contents are, are differentially reinforced in that person’s cognitive system only by virtue of their association with hedonic states. I’ll argue that accepting R-hedonism and rejecting I-hedonism provides a conciliatory position on the traditional altruism debate, and (...) that it coheres well with the neuroscientist Anthony Dickinson’s theory about the evolutionary function of hedonic states, the “hedonic interface theory.” Finally, I’ll defend R-hedonism from potential objections. (shrink)

According to the Thomistic tradition, the Principle of Totality (TPoT) articulates a secondary principle of natural law which guides the exercise of human ownership or dominium over creation. In its general signification, TPoT is a principle of distributive justice determining the right ordering of wholes to their parts. In the medical field it is traditionally understood as entailing an absolute prohibition of bodily mutilation as irrational and immoral, and an imperfect obligation to use the parts of one’s body for the (...) perfection of the bodily whole. TPoT is thus a key element of the system of principles within which an individual exercises her right to life: it helps specify the nature, scope and limits of those actions by which an agent permissibly acts in order to preserve her life. While the Thomistic tradition and the Catholic Church have drawn clear conclusions from the principle regarding, e.g., direct sterilization and non-therapeutic experimentation on human subjects, less attention has been given to the implications of TPoT for non-therapeutic procedures that may positively impact biological functioning or supra-biological goals–that is, for human “enhancement.” We will explore the degree to which TPoT non-univocally guides our use of both artifacts and bodies. We will argue that a careful analysis of these distinct kinds of totalities suggests that the application of TPoT to artifacts and bodies is strongly isomorphic, which is what tempts advocates of the Principle of Autonomy to invalidly infer the absolute dominium of the individual over her body. The inference is invalid because this isomorphism also includes a principle of intrinsic value whose function is to resist the instrumentalization of both artifacts and bodies in some contexts; we are not even related to artifacts as advocates of absolute autonomy believe we are, let alone to our bodies. Rather, the limits of human dominium are determined by the nature and finalities, inherent or acquired, of the objects in question, and it will be argued that articulating these limits raises important, understudied, and fascinating questions about the permissibility of various kinds of human enhancement. (shrink)

Statements about the behavior of biological entities, e.g. about the interaction between two proteins, abound in the literature on molecular biology and are increasingly becoming the targets of information extraction and text mining techniques. We show that an accurate analysis of the semantics of such statements reveals a number of ambiguities that is necessary to take into account in the practice of biomedical ontology engineering. Several concurring formalizations are proposed. Emphasis is laid on the discussion of biological dispositions.

As health systems around the world turn towards highly distributed, specialized and cooperative structures to increase quality and safety of care as well as efficiency and efficacy of delivery processes, there is a growing need for supporting communication and collaboration of all parties involved with advanced ICT solutions. The Electronic Health Record (EHR) provides the information platform which is maturing towards the eHealth core application. To meet the requirements for sustainable, semantically interoperable, and trustworthy EHR solutions, different standards and different (...) national strategies have been established. The workshop summarizes the requirements for such advanced EHR systems and their underlying architecture, presents different strategies and solutions advocated by corresponding protagonists, discusses pros and cons as well as harmonization and migration strategies for those approaches. It particularly highlights a turn towards ontology-driven architectures. (shrink)

Description logics and other formal devices are frequently used as means for preventing or detecting mistakes in ontologies. Some of these devices are also capable of inferring the existence of inter-concept relationships that have not been explicitly entered into an ontology. A prerequisite, however, is that this information can be derived from those formal definitions of concepts and relationships which are included within the ontology. In this paper, we present a novel algorithm that is able to suggest relationships among existing (...) concepts in a formal ontology that are not derivable from such formal definitions. The algorithm exploits cross-lingual information that is implicitly present in the collection of terms used in various languages to denote the concepts and relationships at issue. By using a specific experimental design, we are able to quantify the impact of cross-lingual information in coping with underspecification in formal ontologies. (shrink)

The basics for the Dictionary of Arguments - How a Semantic Search Algorithm for unedited sources may look.

The Basics for the Lexicon of Arguments - How to find non-mentioned concepts.

Kant’s body offered a constant target for his own remarks, both in correspondence and during his lunchtime conversations. Several good descriptions of Kant’s body have come down to us over the centuries, as well as a number of visual representations, but these are remarkably limited, given his stature in the world of ideas. A new description of Kant, written by a novelist who visited Kant while passing through Königsberg, has recently come to light. It is reproduced here — in English (...) translation as well as the original German — and earlier descriptions of Kant are briefly recounted. (shrink)

Knowledge is widely thought to entail belief. But Radford has claimed to offer a counterexample: the case of the unconfident examinee. And Myers-Schulz and Schwitzgebel have claimed empirical vindication of Radford. We argue, in defense of orthodoxy, that the unconfident examinee does indeed have belief, in the epistemically relevant sense of dispositional belief. We buttress this with empirical results showing that when the dispositional conception of belief is specifically elicited, people’s intuitions then conform with the view that knowledge entails (...) (dispositional) belief. (shrink)

Der Titel des Bandes greift eine Frage auf, die im alltäglichen Umgang aufkam: die Frage nach analytischer Philosophie, vom Rücksitz eines Autos gestellt. Dieser Kontext bot den Anlass, eine Herangehensweise zu wählen, die bislang nicht üblich war: auszuprobieren, was eine Einbeziehung des Alltags und Umgangs erbringen könnte, ohne auf Komplexität zu verzichten. -/- Diese Öffnung hat zu überraschenden Ergebnissen geführt, die eine Weiterentwicklung der analytischen Philosophie erlauben, auch und in besonderer Weise theoretisch: Die Beachtung von umgangsprachlichem Verhalten kann dabei behilflich (...) sein, Sprache besser zu verstehen, als dies eine traditionelle wissenschaftsphilosophische Ausrichtung ermöglichen würde. -/- Die Beiträge zu diesem Band haben Kathrina Talmi, Reinhard Matern und Kai Pege eingebracht. (shrink)

Die Erörterung über Zivilisationen und die Goldenen Regeln ist zentral ein sprachliches Projekt, das dazu dienen soll, eine angemessene Bedeutung und mittels dieser einen möglichen Bezug zu finden. Reinhard Matern sucht und entwickelt ein Kriterium, um zivilisierte von unzivilisierten Gesellschaften zu differenzieren und nutzt dabei die weltweit entstandenen Goldenen Regeln, die er im Plural anführt, weil sich die überlieferten Formulierungen konkret unterscheiden. Es sind jedoch nicht die Unterschiede, sondern es ist das Gemeinsame, das ihn auf dem Weg zu einem (...) allgemeinen Kriterium interessiert. -/- Primär im ersten Jahrtausend vor unserer Zeitrechnung werden Spruchweisheiten notiert, über deren Ursprünge nichts bekannt ist. Die Goldenen Regel erlauben gegenüber dem formalisierten Vergeltungsrecht eine grundsätzlich andere Herangehenweise an menschliches Verhalten, ist auf Gleichbehandlung ausgerichtet. Diese vergleichsweise moderne Haltung ermöglicht es, ein allgemeines Kriterium zu bilden. Empirisch ist Gleichbehandlung in heutigen Gesellschaften jedoch immer noch nicht vollzogen, eine Zivilisation deshalb noch nicht erlangt. -/- Zum Abschluss findet sich ein Ausblick, der eine Erweiterung der Perspektive aufgrund zukünftiger Entwicklungen anstrebt: die Integration von humanoiden Robotern. (shrink)

Most epistemologists hold that knowledge entails belief. However, proponents of this claim rarely offer a positive argument in support of it. Rather, they tend to treat the view as obvious and assert that there are no convincing counterexamples. We find this strategy to be problematic. We do not find the standard view obvious, and moreover, we think there are cases in which it is intuitively plausible that a subject knows some proposition P without—or at least without determinately—believing that P. Accordingly, (...) we present five plausible examples of knowledge without (determinate) belief, and we present empirical evidence suggesting that our intuitions about these scenarios are not atypical. (shrink)

The neurosciences not only challenge assumptions about the mind’s place in the natural world but also urge us to reconsider its role in the normative world. Based on mind-brain dualism, the law affords only one-sided protection: it systematically protects bodies and brains, but only fragmentarily minds and mental states. The fundamental question, in what ways people may legitimately change mental states of others, is largely unexplored in legal thinking. With novel technologies to both intervene into minds and detect mental activity, (...) the law should, we suggest, introduce stand alone protection for the inner sphere of persons. We shall address some metaphysical questions concerning physical and mental harm and demonstrate gaps in current doctrines, especially in regard to manipulative interferences with decision-making processes. We then outline some reasons for the law to recognize a human right to mental liberty and propose elements of a novel criminal offence proscribing severe interventions into other minds. (shrink)

Vector models of language are based on the contextual aspects of language, the distributions of words and how they co-occur in text. Truth conditional models focus on the logical aspects of language, compositional properties of words and how they compose to form sentences. In the truth conditional approach, the denotation of a sentence determines its truth conditions, which can be taken to be a truth value, a set of possible worlds, a context change potential, or similar. In the vector models, (...) the degree of co-occurrence of words in context determines how similar the meanings of words are. In this paper, we put these two models together and develop a vector semantics for language based on the simply typed lambda calculus models of natural language. We provide two types of vector semantics: a static one that uses techniques familiar from the truth conditional tradition and a dynamic one based on a form of dynamic interpretation inspired by Heim’s context change potentials. We show how the dynamic model can be applied to entailment between a corpus and a sentence and provide examples. (shrink)

This paper embeds the core part of Discourse Representation Theory in the classical theory of types plus a few simple axioms that allow the theory to express key facts about variables and assignments on the object level of the logic. It is shown how the embedding can be used to combine core analyses of natural language phenomena in Discourse Representation Theory with analyses that can be obtained in Montague Semantics.

In 1964, the young Walter Kasper (born in 1933) was granted by the Faculty of Catholic Theology at Tübingen the licence to teach dogmatic theology on the basis of a thesis on Philosophie und Theologie der Geschichte in der Spätphilosophie Schellings (Philosophy and Theology of History in Schelling’s Late Philosophy). Kasper’s interest in Schelling, himself a student at the Evangelisches Stift at Tübingen, thus originated in the context of his university studies in the school of J.R. Geiselmann and developed in (...) parallel with his theological education. For this reason, it is impossible to form a correct idea of Kasper and his whole theology unless one is willing to take into account this background, not least because he himself has always consciously and forcefully recognised this fact and seen in it his own centre of gravity. Kasper’s work and thought were shaped in a lasting manner during his university years. In fact, his entire academic oeuvre has been nurtured from this fecund origin so much so that he became one of the most well known names associated with the Catholic school at Tübingen to which he gave a new, creative impulse having himself been profoundly inspired by it. ‘He always emphasised his own roots not only as a teacher of theology and a member of the teaching faculty of this institution, but also as bishop’ and cardinal. The principal intention of the present article is precisely this: to return to this beginning and elucidate these decisive years for Kasper in broad outline by way of a relecture and interpretation of his book on The Absolute in History and the particular manner in which he interpreted the so-called second Schelling, an author whom he approached in the wake of Walter Schulz and at practically the same time as Xavier Tilliette. The analysis will subsequently move on into the more properly theological field. (shrink)

In their paper Nothing but the Truth Andreas Pietz and Umberto Rivieccio present Exactly True Logic, an interesting variation upon the four-valued logic for first-degree entailment FDE that was given by Belnap and Dunn in the 1970s. Pietz & Rivieccio provide this logic with a Hilbert-style axiomatisation and write that finding a nice sequent calculus for the logic will presumably not be easy. But a sequent calculus can be given and in this paper we will show that a calculus for (...) the Belnap-Dunn logic we have defined earlier can in fact be reused for the purpose of characterising ETL, provided a small alteration is made—initial assignments of signs to the sentences of a sequent to be proved must be different from those used for characterising FDE. While Pietz & Rivieccio define ETL on the language of classical propositional logic we also study its consequence relation on an extension of this language that is functionally complete for the underlying four truth values. On this extension the calculus gets a multiple-tree character—two proof trees may be needed to establish one proof. (shrink)

In this paper we give an analytic tableau calculus P L 1 6 for a functionally complete extension of Shramko and Wansing’s logic. The calculus is based on signed formulas and a single set of tableau rules is involved in axiomatising each of the four entailment relations ⊧ t, ⊧ f, ⊧ i, and ⊧ under consideration—the differences only residing in initial assignments of signs to formulas. Proving that two sets of formulas are in one of the first three entailment (...) relations will in general require developing four tableaux, while proving that they are in the ⊧ relation may require six. (shrink)

Vector models of language are based on the contextual aspects of words and how they co-occur in text. Truth conditional models focus on the logical aspects of language, the denotations of phrases, and their compositional properties. In the latter approach the denotation of a sentence determines its truth conditions and can be taken to be a truth value, a set of possible worlds, a context change potential, or similar. In this short paper, we develop a vector semantics for language based (...) on the simply typed lambda calculus. Our semantics uses techniques familiar from the truth conditional tradition and is based on a form of dynamic interpretation inspired by Heim's context updates. (shrink)

The paper shows how ideas that explain the sense of an expression as a method or algorithm for finding its reference, preshadowed in Frege’s dictum that sense is the way in which a referent is given, can be formalized on the basis of the ideas in Thomason (1980). To this end, the function that sends propositions to truth values or sets of possible worlds in Thomason (1980) must be replaced by a relation and the meaning postulates governing the behaviour of (...) this relation must be given in the form of a logic program. The resulting system does not only throw light on the properties of sense and their relation to computation, but also shows circular behaviour if some ingredients of the Liar Paradox are added. The connection is natural, as algorithms can be inherently circular and the Liar is explained as expressing one of those. Many ideas in the present paper are closely related to those in Moschovakis (1994), but receive a considerably lighter formalization. (shrink)

In this paper we introduce a Gentzen calculus for (a functionally complete variant of) Belnap's logic in which establishing the provability of a sequent in general requires \emph{two} proof trees, one establishing that whenever all premises are true some conclusion is true and one that guarantees the falsity of at least one premise if all conclusions are false. The calculus can also be put to use in proving that one statement \emph{necessarily approximates} another, where necessary approximation is a natural dual (...) of entailment. The calculus, and its tableau variant, not only capture the classical connectives, but also the `information' connectives of four-valued Belnap logics. This answers a question by Avron. (shrink)

In this paper we define intensional models for the classical theory of types, thus arriving at an intensional type logic ITL. Intensional models generalize Henkin's general models and have a natural definition. As a class they do not validate the axiom of Extensionality. We give a cut-free sequent calculus for type theory and show completeness of this calculus with respect to the class of intensional models via a model existence theorem. After this we turn our attention to applications. Firstly, it (...) is argued that, since ITL is truly intensional, it can be used to model ascriptions of propositional attitude without predicting logical omniscience. In order to illustrate this a small fragment of English is defined and provided with an ITL semantics. Secondly, it is shown that ITL models contain certain objects that can be identified with possible worlds. Essential elements of modal logic become available within classical type theory once the axiom of Extensionality is given up. (shrink)

A logic is called higher order if it allows for quantification over higher order objects, such as functions of individuals, relations between individuals, functions of functions, relations between functions, etc. Higher order logic began with Frege, was formalized in Russell [46] and Whitehead and Russell [52] early in the previous century, and received its canonical formulation in Church [14].1 While classical type theory has since long been overshadowed by set theory as a foundation of mathematics, recent decades have shown remarkable (...) comebacks in the fields of mechanized reasoning (see, e.g., Benzm¨. (shrink)

In this paper we consider the theory of predicate logics in which the principle of Bivalence or the principle of Non-Contradiction or both fail. Such logics are partial or paraconsistent or both. We consider sequent calculi for these logics and prove Model Existence. For L4, the most general logic under consideration, we also prove a version of the Craig-Lyndon Interpolation Theorem. The paper shows that many techniques used for classical predicate logic generalise to partial and paraconsistent logics once the right (...) set-up is chosen. Our logic L4 has a semantics that also underlies Belnap’s [4] and is related to the logic of bilattices. L4 is in focus most of the time, but it is also shown how results obtained for L4 can be transferred to several variants. (shrink)

A cursory glance at the list of Nobel Laureates for Economics is sufficient to confirm Stanovich’s description of the project to evaluate human rationality as seminal. Herbert Simon, Reinhard Selten, John Nash, Daniel Kahneman, and others, were awarded their prizes less for their work in economics, per se, than for their work on rationality, as such. Although philosophical works have for millennia attempted to describe, explicate and evaluate individual and collective aspects of rationality, new impetus was brought to this (...) endeavor over the last century as mathematical logic along with the social and behavioral sciences emerged. Yet more recently, over the last several decades, propelled by the emergence of artificial intelligence, cognitive science, evolutionary psychology, neuropsychology, and related fields, even more sophisticated approaches to the study of rationality have emerged. (shrink)

In this paper it is shown how the DRT (Discourse Representation Theory) treatment of temporal anaphora can be formalized within a version of Montague Semantics that is based on classical type logic.

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)

In their recent paper Bi-facial truth: a case for generalized truth values Zaitsev and Shramko [7] distinguish between an ontological and an epistemic interpretation of classical truth values. By taking the Cartesian product of the two disjoint sets of values thus obtained, they arrive at four generalized truth values and consider two “semi-classical negations” on them. The resulting semantics is used to define three novel logics which are closely related to Belnap’s well-known four valued logic. A syntactic characterization of these (...) logics is left for further work. In this paper, based on our previous work on a functionally complete extension of Belnap’s logic, we present a sound and complete tableau calculus for these logics. It crucially exploits the Cartesian nature of the four values, which is reflected in the fact that each proof consists of two tableaux. The bi-facial notion of truth of Z&S is thus augmented with a bi-facial notion of proof. We also provide translations between the logics for semi-classical negation and classical logic and show that an argument is valid in a logic for semi-classical negation just in case its translation is valid in classical logic. (shrink)

Standard approaches to proper names, based on Kripke's views, hold that the semantic values of expressions are (set-theoretic) functions from possible worlds to extensions and that names are rigid designators, i.e.\ that their values are \emph{constant} functions from worlds to entities. The difficulties with these approaches are well-known and in this paper we develop an alternative. Based on earlier work on a higher order logic that is \emph{truly intensional} in the sense that it does not validate the axiom scheme of (...) Extensionality, we develop a simple theory of names in which Kripke's intuitions concerning rigidity are accounted for, but the more unpalatable consequences of standard implementations of his theory are avoided. The logic uses Frege's distinction between sense and reference and while it accepts the rigidity of names it rejects the view that names have direct reference. Names have constant denotations across possible worlds, but the semantic value of a name is not determined by its denotation. (shrink)

The paper develops Lambda Grammars, a form of categorial grammar that, unlike other categorial formalisms, is non-directional. Linguistic signs are represented as sequences of lambda terms and are combined with the help of linear combinators.

There are two kinds of semantic theories of anaphora. Some, such as Heim’s File Change Semantics, Groenendijk and Stokhof’s Dynamic Predicate Logic, or Muskens’ Compositional DRT (CDRT), seem to require full coindexing of anaphora and their antecedents prior to interpretation. Others, such as Kamp’s Discourse Representation Theory (DRT), do not require this coindexing and seem to have an important advantage here. In this squib I will sketch a procedure that the first group of theories may help themselves to so that (...) they can interleave interpretation and coindexing in DRT’s way. (shrink)

During much of the past century, it was widely believed that phonemes--the human speech sounds that constitute words--have no inherent semantic meaning, and that the relationship between a combination of phonemes (a word) and its referent is simply arbitrary. Although recent work has challenged this picture by revealing psychological associations between certain phonemes and particular semantic contents, the precise mechanisms underlying these associations have not been fully elucidated. Here we provide novel evidence that certain phonemes have an inherent, non-arbitrary emotional (...) quality. Moreover, we show that the perceived emotional valence of certain phoneme combinations depends on a specific acoustic feature--namely, the dynamic shift within the phonemes' first two frequency components. These data suggest a phoneme-relevant acoustic property influencing the communication of emotion in humans, and provide further evidence against previously held assumptions regarding the structure of human language. This finding has potential applications for a variety of social, educational, clinical, and marketing contexts. (shrink)

This paper introduces λ-grammar, a form of categorial grammar that has much in common with LFG. Like other forms of categorial grammar, λ-grammars are multi-dimensional and their components are combined in a strictly parallel fashion. Grammatical representations are combined with the help of linear combinators, closed pure λ-terms in which each abstractor binds exactly one variable. Mathematically this is equivalent to employing linear logic, in use in LFG for semantic composition, but the method seems more practicable.

The ‘syntax’ and ‘combinatorics’ of my title are what Curry (1961) referred to as phenogrammatics and tectogrammatics respectively. Tectogrammatics is concerned with the abstract combinatorial structure of the grammar and directly informs semantics, while phenogrammatics deals with concrete operations on syntactic data structures such as trees or strings. In a series of previous papers (Muskens, 2001a; Muskens, 2001b; Muskens, 2003) I have argued for an architecture of the grammar in which finite sequences of lambda terms are the basic data structures, (...) pairs of terms syntax, semantics for example. These sequences then combine with the help of simple generalizations of the usual abstraction and application operations. This theory, which I call Lambda Grammars and which is closely related to the independently formulated theory of Abstract Categorial Grammars (de Groote, 2001; de Groote, 2002), in fact is an implementation of Curry’s ideas: the level of tectogrammar is encoded by the sequences of lambda-terms and their ways of combination, while the syntactic terms in those sequences constitute the phenogrammatical level. In de Groote’s formulation of the theory, tectogrammar is the level of abstract terms, while phenogrammar is the level of object terms. (shrink)

We present Logical Description Grammar (LDG), a model ofgrammar and the syntax-semantics interface based on descriptions inelementary logic. A description may simultaneously describe the syntacticstructure and the semantics of a natural language expression, i.e., thedescribing logic talks about the trees and about the truth-conditionsof the language described. Logical Description Grammars offer a naturalway of dealing with underspecification in natural language syntax andsemantics. If a logical description (up to isomorphism) has exactly onetree plus truth-conditions as a model, it completely specifies thatgrammatical (...) object. More common is the situation, corresponding tounderspecification, in which there is more than one model. A situation inwhich there are no models corresponds to an ungrammatical input. (shrink)

This paper uses classical logic for a simultaneous description of the syntax and semantics of a fragment of English and it is argued that such an approach to natural language allows procedural aspects of linguistic theory to get a purely declarative formulation. In particular, it will be shown how certain construction rules in Discourse Representation Theory, such as the rule that indefinites create new discourse referents and definites pick up an existing referent, can be formulated declaratively if logic is used (...) as a metalanguage for English. In this case the declarative aspects of a rule are highlighted when we focus on the model theory of the description language while a procedural perspective is obtained when its proof theory is concentrated on. Themes of interest are Discourse Representation Theory, resolution of anaphora, resolution of presuppositions, and underspecification. (shrink)

This paper argues for the idea that in describing language we should follow Haskell Curry in distinguishing between the structure of an expression and its appearance or manifestation . It is explained how making this distinction obviates the need for directed types in type-theoretic grammars and a simple grammatical formalism is sketched in which representations at all levels are lambda terms. The lambda term representing the abstract structure of an expression is homomorphically translated to a lambda term representing its manifestation, (...) but also to a lambda term representing its semantics. (shrink)

In this paper it is shown how simple texts that can be parsed in a Lambek Categorial Grammar can also automatically be provided with a semantics in the form of a Discourse Representation Structure in the sense of Kamp [1981]. The assignment of meanings to texts uses the Curry-Howard-Van Benthem correspondence.

Ambiguities in natural language can multiply so fast that no person or machine can be expected to process a text of even moderate length by enumerating all possible disambiguations. A sentence containing $n$ scope bearing elements which are freely permutable will have $n!$ readings, if there are no other, say lexical or syntactic, sources of ambiguity. A series of $m$ such sentences would lead to $(n!)^m$ possibilities. All in all the growth of possibilities will be so fast that generating readings (...) first and testing their acceptability afterwards will not be feasible. -/- This insight has led a series of researchers to adopt a level of representation at which ambiguities remain unresolved. The idea here is not to generate and test many possible interpretations but to first generate one `underspecified' representation which in a sense represents all its complete specifications and then use whatever information is available to further specify the result. -/- One central hypothesis in the paper will be that the relation between an underspecified representation and its full representations is not so much the relation between one structure and a set of other structures but is in fact the relation between a description (a set of logical sentences) and its models. (shrink)

In a recent paper we have defined an analytic tableau calculus PL_16 for a functionally complete extension of Shramko and Wansing's logic based on the trilattice SIXTEEN_3. This calculus makes it possible to define syntactic entailment relations that capture central semantic relations of the logic---such as the relations |=_t, |=_f, and |=_i that each correspond to a lattice order in SIXTEEN_3; and |=, the intersection of |=_t and |=_f,. -/- It turns out that our method of characterising these semantic relations---as (...) intersections of auxiliary relations that can be captured with the help of a single calculus---lends itself well to proving interpolation. All entailment relations just mentioned have the interpolation property, not only when they are defined with respect to a functionally complete language, but also in a range of cases where less expressive languages are considered. For example, we will show that |=, when restricted to L_{tf}, the language originally considered by Shramko and Wansing, enjoys interpolation. This answers a question that was recently posed by M. Takano. (shrink)