Michiel Van Lambalgen

We show how sequent calculi for some generalized quantifiers can be obtained by generalizing the Herbrand approach to ordinary first order proof theory. Typical of the Herbrand approach, as compared to plain sequent calculus, is increased control over relations of dependence between variables. In the case of generalized quantifiers, explicit attention to relations of dependence becomes indispensible for setting up proof systems. It is shown that this can be done by turning variables into structured objects, governed by various types of structural rules. These structured variables are interpreted semantically by means of a dependence relation. This relation is an analogue of the accessibility relation in modal logic. We then isolate a class of axioms for generalized quantifiers which correspond to first-order conditions on the dependence relation.

In zijn artikel geeft Hans Radder een rijk en veelomvattend beeld van zijn ideeën over een aantal centrale aspecten van wetenschap en wetenschappelijke experimenten, en de rol die materiële realisatie, interpretatie en abstractie daarin spelen. Het is een uiteenzetting op een hoog niveau van abstractie, op basis van veel eerder gepubliceerd werk. Het is ook een beeld met grote samenhang: de diverse aspecten die de revue passeren zijn op allerlei wijzen aan elkaar gerelateerd. Als men uit zo’n samenhangend geheel twee elementen isoleert loopt men natuurlijk kans om allerlei subtiele aspecten over het hoofd te zien. Maar gezien de aard van dit commentaar, en de beknoptheid ervan, kan dat niet anders. ​In wat volgt willen we twee punten aan de orde stellen: de vraag wat de relatie is tussen abstracte begrippen zoals Radder die analyseert en betekenis; en de vraag in hoeverre het beeld dat Radder geeft specifiek is voor de natuurwetenschappen of ook repercussies heeft voor andere wetenschappen, in het bijzonder de taalwetenschap.

We sketch four applications of Marr's levels‐of‐analysis methodology to the relations between logic and experimental data in the cognitive neuroscience of language and reasoning. The first part of the paper illustrates the explanatory power of computational level theories based on logic. We show that a Bayesian treatment of the suppression task in reasoning with conditionals is ruled out by EEG data, supporting instead an analysis based on defeasible logic. Further, we describe how results from an EEG study on temporal prepositions can be reanalyzed using formal semantics, addressing a potential confound. The second part of the article demonstrates the predictive power of logical theories drawing on EEG data on processing progressive constructions and on behavioral data on conditional reasoning in people with autism. Logical theories can constrain processing hypotheses all the way down to neurophysiology, and conversely neuroscience data can guide the selection of alternative computational level models of cognition.

In recent years we have witnessed a cognitive or ‘practical’ turn in logic [Gabbay and Woods, 2005; Urbański, 2011]. The most fundamental claim of its proponents is that logic has much to say about actual reasoning and argumentation. This cognitively-orientated logic. It acquires a new task of “systematically keeping track of changing representations of information” [van Benthem, 2008, p. 73], and, due to all the achievements of the mathematisation of logic, is fully up to this task. It also contests the claim that distinction between a descriptive and a normative account of the analysis of reasoning is disjoint and exhaustive [Gabbay and Woods, 2003, p. 37].

In this paper we provide a mathematical model of Kant’s temporal continuum that yields formal correlates for Kant’s informal treatment of this concept in theCritique of Pure Reasonand in other works of his critical period. We show that the formal model satisfies Kant’s synthetic a priori principles for time and that it even illuminates what “faculties and functions” must be in place, as “conditions for the possibility of experience”, for time to satisfy such principles. We then present a mathematically precise account of Kant’s transcendental theory of time—the most precise account to date.Moreover, we show that the Kantian continuum which we obtain has some affinities with the Brouwerian continuum but that it also has “infinitesimal intervals” consisting of nilpotent infinitesimals; these allow us to capture Kant’s theory of rest and motion in theMetaphysical Foundations of Natural Science.While our focus is on Kant’s theory of time the material in this paper is more generally relevant for the problem of developing a rigorous theory of the phenomenological continuum, in the tradition of Whitehead, Russell, and Weyl among others.

Interpretation is the process whereby a hearer reasons to an interpretation of a speaker's discourse. The hearer normally adopts a credulous attitude to the discourse, at least for the purposes of interpreting it. That is to say the hearer tries to accommodate the truth of all the speaker's utterances in deriving an intended model. We present a nonmonotonic logical model of this process which defines unique minimal preferred models and efficiently simulates a kind of closed‐world reasoning of particular interest for human cognition. Byrne's “suppression” data (Byrne, 1989) are used to illustrate how variants on this logic can capture and motivate subtly different interpretative stances which different subjects adopt, thus indicating where more fine‐grained empirical data are required to understand what subjects are doing in this task. We then show that this logical competence model can be implemented in spreading activation network models. A one pass process interprets the textual input by constructing a network which then computes minimal preferred models for (3‐valued) valuations of the set of propositions of the text. The neural implementation distinguishes easy forward reasoning from more complex backward reasoning in a way that may be useful in explaining directionality in human reasoning.

ADHD is a psychiatric disorder characterised by persistent and developmentally inappropriate levels of inattention, impulsivity and hyperactivity. It is known that children with ADHD tend to produce incoherent discourses, e.g. by narrating events out of sequence. Here the aetiology of ADHD becomes of interest. One prominent theory is that ADHD is an executive function disorder, showing deficiencies of planning. Given the close link between planning, verb tense and discourse coherence postulated in van Lambalgen and Hamm (The proper treatment of events, 2004), we predicted specific deviations in the verb tenses produced by children with ADHD. Here we report on an experiment corroborating these predictions.

Executive function has become an important concept in explanations of psychiatric disorders, but we currently lack comprehensive models of normal executive function and of its malfunctions. Here we illustrate how defeasible logical analysis can aid progress in this area. We illustrate using autism and attention deficit hyperactivity disorder (ADHD) as example disorders, and show how logical analysis reveals commonalities between linguistic and non-linguistic behaviours within each disorder, and how contrasting sub-components of executive function are involved across disorders. This analysis reveals how logical analysis is as applicable to fast, automatic and unconscious reasoning as it is to slow deliberate cogitation.

In this paper we present a semantic analysis of the imperfective paradox based on the Event Calculus, a planning formalism characterizing a class of models which can be computed by connectionist networks. We report the results of a questionnaire that support the semantic theory and suggest that different aspectual classes of VPs in the progressive give rise to different entailment patterns. Further, a processing model is outlined, combining the semantic analysis with the psycholinguistic principle of immediacy in the framework of recurrent networks. The model is used to derive predictions concerning the electrophysiological correlates of the computations described by the Event Calculus.

This essay attempts to develop a psychologically informed semantics of perception reports, whose predictions match with the linguistic data. As suggested by the quotation from Miller and Johnson-Laird, we take a hallmark of perception to be its fallible nature; the resulting semantics thus necessarily differs from situation semantics. On the psychological side, our main inspiration is Marr's (1982) theory of vision, which can easily accomodate fallible perception. In Marr's theory, vision is a multi-layered process. The different layers have filters of different gradation, which makes vision at each of them approximate. On the logical side, our task is therefore twofold • to formalise the layers and the ways in which they may refine each other, and • to develop logical means to let description vary with such degrees of refinement. The first task is formalised by means of an inverse systems of first order models, with reality appearing as its inverse limit. The second task is formalised by means of so-called conditional quantifiers, a new form of generalised quantification which can best be described as resource bounded quantification. We show that the logic provides for a semantics and pragmatics of direct perception reports. In particular, direct perception reports have a possibly nonveridical, approximative semantics, which becomes veridical only by virtue of our pragmatic expectation that what is perceived would continue to be the case, were we to perceive more accurately. It is a general feature of resource bounded logics that the underlying logics are weak, but that stronger principles can be obtained pragmatically, by strengthening the resource. For the logic of vision this feature is clarified by showing how changes in the resource capture different notions of partiality, and by studying how the perception verb interacts with connectives and quantifiers in different visual contexts. The inference Veridicality, which is now viewed rather as a nonmonotonic inference, is also studied in depth. We end with an attempt to buttress the proposed model by comparing it with suggestions put forward in Cognitive or Conceptual Semantics, in the literature on evidentials, and in Husserl's philosophy of perception.

In this article we provide a mathematical model of Kant?s temporal continuum that satisfies the (not obviously consistent) synthetic a priori principles for time that Kant lists in the Critique of pure Reason (CPR), the Metaphysical Foundations of Natural Science (MFNS), the Opus Postumum and the notes and frag- ments published after his death. The continuum so obtained has some affinities with the Brouwerian continuum, but it also has ‘infinitesimal intervals’ consisting of nilpotent infinitesimals, which capture Kant’s theory of rest and motion in MFNS. While constructing the model, we establish a concordance between the informal notions of Kant?s theory of the temporal continuum, and formal correlates to these notions in the mathematical theory. Our mathematical reconstruction of Kant?s theory of time allows us to understand what ?faculties and functions? must be in place for time to satisfy all the synthetic a priori principles for time mentioned. We have presented here a mathematically precise account of Kant?s transcendental argument for time in the CPR and of the rela- tion between the categories, the synthetic a priori principles for time, and the unity of apperception; the most precise account of this relation to date. We focus our exposition on a mathematical analysis of Kant’s informal terminology, but for reasons of space, most theorems are explained but not formally proven; formal proofs are available in (Pinosio, 2017). The analysis presented in this paper is related to the more general project of developing a formalization of Kant’s critical philosophy (Achourioti & van Lambalgen, 2011). A formal approach can shed light on the most controversial concepts of Kant’s theoretical philosophy, and is a valuable exegetical tool in its own right. However, we wish to make clear that mathematical formalization cannot displace traditional exegetical methods, but that it is rather an exegetical tool in its own right, which works best when it is coupled with a keen awareness of the subtleties involved in understanding the philosophical issues at hand. In this case, a virtuous ?hermeneutic circle? between mathematical formalization and philosophical discourse arises.

Compositionality remains effective as an explanation of cases in which processing complexity increases due to syntactic factors only. It falls short of accounting for situations in which complexity arises from interactions with the sentence or discourse context, perceptual cues, and stored knowledge. The idea of compositionality as a methodological principle is appealing, but imputing the complexity to one component of the grammar or another, instead of enriching the notion of composition, is not always an innocuous move, leading to fully equivalent theories. Compositionality sets an upper bound on the degree of informational encapsulation that can be posited by modular or component-based theories of language: simple composition ties in with a strongly modular take on meaning assembly, which is seen as sealed off from information streams other than the lexicon and the syntax.

Sieg has proposed axioms for computability whose models can be reduced to Turing machines. This lecture will investigate to what extent these axioms hold for reasoning. In particular we focus on the requirement that the configurations that a computing agent (whether human or machine) operates on must be ’immediately recognisable’. If one thinks of reasoning as derivation in a calculus, this requirement is satisfied; but even in contexts which are only slightly less formal, the requirement cannot be met. Our main example will be the Wason selection task, a propositional reasoning task in which in a typical (undergraduate) subject group only around 5% arrive at the answer dictated by classical logic. The instructions for this task (as well as other standard tasks in the psychology of reasoning, such as syllogisms) do not contain any ’immediately recognisable’ configurations. The subject must try to find an interpretation of the task by making the various elements in the instructions cohere, in effect solving a difficult constraint satisfaction problem, which has no unique solution. The subject has given a complete interpretation of the task if she can formulate the problem posed in the task as a theorem to be proved. The complexity of such theorems can be quite high; e.g. for the propositional Wason selection task the theorem can be in Σ1 3 . This sounds implausible, but we’ll present experimental data confirming this point