This paper aims to develop the implications of logical expressivism for a theory of dialogue coherence. I proceed in three steps. Firstly, certain structural properties of cooperative dialogue are identified. Secondly, I describe a variant of the multi-agent natural deduction calculus that I introduced in Piwek (J Logic Lang Inf 16(4):403–421, 2007 ) and demonstrate how it accounts for the aforementioned structures. Thirdly, I examine how the aforementioned system can be used to formalise an expressivist account of logical vocabulary that (...) is inspired by Brandom (Making it explicit: reasoning, representing, and discursive commitment, 1994 ; Articulating reasons: an introduction to inferentialism, 2000 ). This account conceives of the logical vocabulary as a tool which allows speakers to describe the inferential practices which underlie their language use, i.e., it allows them to make those practices explicit. The rewards of this exercise are twofold: (1) We obtain a more precise account of logical expressivism which can be defended more effectively against the critique that such accounts lead to cultural relativism. (2) The formalised distinction between engaging in a practice and expressing it, opens the way for a revision of the theory of dialogue coherence. This revision eliminates the need for logically complex formulae to account for certain structural properties of cooperative dialogue. (shrink)

In this paper investigates how natural deduction rules define connective meaning by presenting a new method for reading semantical conditions from rules called natural semantics. Natural semantics explains why the natural deduction rules are profoundly intuitionistic. Rules for conjunction, implication, disjunction and equivalence all express intuitionistic rather than classical truth conditions. Furthermore, standard rules for negation violate essential conservation requirements for having a natural semantics. The standard rules simply do not assign a meaning to the negation sign. Intuitionistic negation fares (...) much better. Not only do the intuitionistic rules have a natural semantics, that semantics amounts to familiar intuitionistic truth conditions. We will make use of these results to argue that intuitionistic connectives, rather than standard ones have a better claim to being the truly logical connectives. (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)

A distinction is drawn between situations as indices required for semantically evaluating sentences and situations as denotations resulting from such evaluation. For atomic sentences, possible worlds may serve as indices, and events as denotations. The distinction is extended beyond atomic sentences according to formulae-as-types and applied to implicit quantifier domain restrictions, intensionality and conditionals.

In its origins Dialogical logic constituted the logical foundations of an overall new movement called the Erlangen School or Erlangen Constructivism that should provide a new start to a general theory of language and of science. In relation to the theory of language, according to the Erlangen-School, language is not just a fact that we discover, but a human cultural accomplishment whose construction reason can and should control. The constructive development of a scientific language was called the Orthosprache-project. Unfortunately, the (...) Orthosprache-project was not further developed and somehow seemed to fade away. Perhaps, one could say that one of the reasons is that the semantic links between dialogical logic, that was restricted to logical constants, and the more general linguistic aspirations of the Orthosprache were not sufficiently developed and then the new theory of meaning of dialogical logic seemed to be cut off from the project of setting the basis for a general theory of meaning.In the present paper we would like to contribute to precise one possible way in which a general dialogical theory of meaning could be linked to dialogical logic. More precisely, the main aim of the article is to set the basis for the meaning of elementary sentences in the context of dialogical interaction. (shrink)

In this paper we propose a way to deal with natural language inference by implementing Modern Type Theoretical Semantics in the proof assistant Coq. The paper is a first attempt to deal with NLI and natural language reasoning in general by using the proof assistant technology. Valid NLIs are treated as theorems and as such the adequacy of our account is tested by trying to prove them. We use Luo’s Modern Type Theory with coercive subtyping as the formal language into (...) which we translate natural language semantics, and we further implement these semantics in the Coq proof assistant. It is shown that the use of a MTT with an adequate subtyping mechanism can give us a number of promising results as regards NLI. Specifically, it is shown that a number of inference cases, i.e. quantifiers, adjectives, conjoined noun phrases and temporal reference among other things can be successfully dealt with. It is then shown, that even though Coq is an interactive and not an automated theorem prover, automation of all of the test examples is possible by introducing user-defined automated tactics. Lastly, the paper offers a number of innovative approaches to NL phenomena like adjectives, collective predication, comparatives and factive verbs among other things, contributing in this respect to the theoretical study of formal semantics using MTTs. (shrink)

In this paper, we study dialogue as a game, but not only in the sense in which there would exist winning strategies and a priori rules. Dialogue is not governed by game rules like for chess or other games, since even if we start from a priori rules, it is always possible to play with them, provided that some invariant properties are preserved. An important discovery of Ludics is that such properties may be expressed in geometrical terms. The main feature (...) of a dialogue is “convergence”. Intuitively, a dialogue “diverges” when it stops prematurely by some disruption, or a violation of the tacit agreed upon conditions of the discourse. It converges when the two speakers go together towards a situation where they agree at least on some points. As we shall see, convergence may be thought of through the geometrical concept of orthogonality . Utterances in a dialogue have as their content, not only the processes (similar to proofs) which lead to them from a monologic view, but also their interactions with other utterances. Finally, any utterance must be seen as co-constructed in an interaction between two processes. That is to say that it not only contains one speaker’s intentions but also his or her expectations from the other interlocutor. From our viewpoint, discursive strategies like narration , elaboration , topicalization may derive from such interactions, as well as speech acts like assertion, question and denegation. (shrink)

This paper presents a novel proof-theoretic account of dialogue coherence. It focuses on an abstract class of cooperative information-oriented dialogues and describes how their structure can be accounted for in terms of a multi-agent hybrid inference system that combines natural deduction with information transfer and observation. We show how certain dialogue structures arise out of the interplay between the inferential roles of logical connectives (i.e., sentence semantics), a rule for transferring information between agents, and a rule for information flow between (...) agents and their environment. The order of explanation is opposite in direction to that adopted in game-theoretic semantics, where sentence semantics (or a notion of valid inference) is derived from winning dialogue strategies. That approach and the current one may, however, be reconcilable, since we focus on cooperative dialogue, whereas the game-theoretic tradition concentrates on adversarial dialogue. (shrink)

In formal semantics based on modern type theories, some sentences may be interpreted as judgements and some as logical propositions. When interpreting composite sentences, one may want to turn a judgemental interpretation or an ill-typed semantic interpretation into a proposition in order to obtain an intended semantics. For instance, an incorrect judgement $$a:A$$ may be turned into its propositional form $$\textsc {is}(A,a)$$ and an ill-typed application p(a) into $$\textsc {do}(p,a)$$, so that the propositional forms can take part in logical compositions (...) that interpret composite sentences, especially those that involve negations and conditionals.In this paper, we propose an operator not that facilitates such a transformation. Introducing not axiomatically, with five axiomatic laws to govern its behaviour, we shall use it to define $$\textsc {is}$$ and $$\textsc {do}$$ and give examples to illustrate its use in semantic interpretation. The introduction of not into type theories is logically consistent – this is justified by showing that not can be defined by means of the heterogeneous equality $$\textrm{JMeq}$$ so that all of the axiomatic laws for not become provable. Therefore, since the extension with $$\textrm{JMeq}$$ preserves logical consistency, so does the extension with not. We shall also study conditions under which $$\textsc {is}$$ and $$\textsc {do}$$ operators can be used safely without the risk of over-generation. (shrink)

Recent literature on dialogical logic discusses the case of tonk and the notion harmony in the context of a rule-based theory of meaning. Now, since the publications of those papers, a dialogical version of constructive type theory has been developed. The aim of the present paper is to show that, from the dialogical point of view, the harmony of the CTT-rules is the consequence of a more fundamental level of meaning characterized by the independence of players. We hope that the (...) following paper will contribute to a better understanding of the dialogical notion of meaning. (shrink)

This paper presents a novel proof-theoretic account of dialogue coherence. It focuses on an abstract class of cooperative information-oriented dialogues and describes how their structure can be accounted for in terms of a multi-agent hybrid inference system that combines natural deduction with information transfer and observation. We show how certain dialogue structures arise out of the interplay between the inferential roles of logical connectives (i.e., sentence semantics), a rule for transferring information between agents, and a rule for information flow between (...) agents and their environment. The order of explanation is opposite in direction to that adopted in game-theoretic semantics, where sentence semantics (or a notion of valid inference) is derived from winning dialogue strategies. That approach and the current one may, however, be reconcilable, since we focus on cooperative dialogue, whereas the game-theoretic tradition concentrates on adversarial dialogue. (shrink)

Canonical Propositional Gentzen-type systems are systems which in addition to the standard axioms and structural rules have only pure logical rules with the sub-formula property, in which exactly one occurrence of a connective is introduced in the conclusion, and no other occurrence of any connective is mentioned anywhere else. In this paper we considerably generalize the notion of a “canonical system” to first-order languages and beyond. We extend the Propositional coherence criterion for the non-triviality of such systems to rules with (...) unary quantifiers and show that it remains constructive. Then we provide semantics for such canonical systems using 2-valued non-deterministic matrices extended to languages with quantifiers, and prove that the following properties are equivalent for a canonical system G: (1) G admits Cut-Elimination, (2) G is coherent, and (3) G has a characteristic 2-valued non-deterministic matrix. (shrink)

This paper provides a detailed comparison between discourse representation theory and dependent type semantics, two frameworks for discourse semantics. Although it is often stated that DRT and those frameworks based on dependent types are mutually exchangeable, we argue that they differ with respect to variable handling, more specifically, how substitution and other operations on variables are defined. This manifests itself in two recalcitrant problems posed for DRT; namely, the overwrite problem and the duplication problem. We will see that these problems (...) still pose a challenge for various extended compositional systems based on DRT, while they do not arise in a framework of DTS where substitution and other operations are defined in the standard type-theoretic manner without stipulating any additional constraints. We also compare the notions of contexts underlying these two kinds of frameworks, namely, contexts represented as assignment functions and contexts represented as proof terms, and see what different predictions they make for some linguistic examples. (shrink)

In the present paper I wish to regard constructivelogic as a self-contained system for the treatment ofepistemological issues; the explanations of theconstructivist logical notions are cast in anepistemological mold already from the outset. Thediscussion offered here intends to make explicit thisimplicit epistemic character of constructivism.Particular attention will be given to the intendedinterpretation laid down by Heyting. This interpretation, especially as refined in the type-theoretical work of Per Martin-Löf, puts thesystem on par with the early efforts of Frege andWhitehead-Russell. This quite (...) recent work, however,has proved valuable not only in the philosophy andfoundations of mathematics, but has also foundpractical application in computer science, where thelanguage of constructivism serves as an implementableprogramming language, and within the philosophy oflanguage.\footnote{Nordstr\"{o}m et al. give an overview of the work in computerscience, whereas Ranta provides an impressiveconstructivist alternative to Montague Grammar usingthe richer type structure of Martin-L\"{o}f in placeof the simple classical type theory of Church.} Mypresentation will be carried out through a contrastwith standard metamathematical work.\footnote{Troelstra and van Dalen give an encyclopedictreatment of the metamathematics of constructivism.}In the course of the development I have occasion tooffer some novel considerations on thenature of proof and inference. (shrink)

Without violating the spirit of Game-Theoretical semantics, its results can be re-worked in Martin-Löf''s Constructive Type Theory by interpreting games as types of Myself''s winning strategies. The philosophical ideas behind Game-Theoretical Semantics in fact highly recommend restricting strategies to effective ones, which is the only controversial step in our interpretation. What is gained, then, is a direct connection between linguistic semantics and computer programming.

D. M. GABBAY and F. GUENTHER, Handbook of philosophical logic, 2nd edn, vol. 9. Dordrecht, Boston, London: Kluwer, 2002. xiv + 368 pp. €129.00, US$112.00, £79.00. ISBN1 402 00699 3. The philo...

Situations serving as partial worlds as well as events in natural language semantics are constructed from a type-theoretic interpretation of firstorder formulae and (after a type reduction) temporal formulae. Limitations of the Russell-Wiener-Kamp derivation of time from events are discussed and overcome to give a more widely applicable account of temporal granularity. Finite situations are formulated as strings of observations, conceptualized to persist inertially (in the absence of forces).

As a new foundational language for mathematics with its very different idea as to the status of logic, we should expect homotopy type theory to shed new light on some of the problems of philosophy which have been treated by logic. In this article, definite description, and in particular its employment within mathematics, is formulated within the type theory. Homotopy type theory has been proposed as an inherently structuralist foundational language for mathematics. Using the new formulation of definite descriptions, opportunities (...) to express ‘the structure of’ within homotopy type theory are explored, and it is shown there is little or no need for this expression. (shrink)