This paper is devoted to the formulation and investigation of a dynamic semantic interpretation of the language of first-order predicate logic. The resulting system, which will be referred to as ‘dynamic predicate logic’, is intended as a first step towards a compositional, non-representational theory of discourse semantics. In the last decade, various theories of discourse semantics have emerged within the paradigm of model-theoretic semantics. A common feature of these theories is a tendency to do (...) away with the principle of compositionality, a principle which, implicitly or explicitly, has dominated semantics since the days of Frege. Therefore the question naturally arises whether non-compositionality is in any way a necessary feature of discourse semantics. Since we subscribe to the interpretation of compositionality as constituting primarily a methodological principle, we consider this to be a methodological rather than an empirical question. As a consequence, the emphasis in the present paper lies on developing an alternative compositional semantics of discourse, which is empirically equivalent to its non-compositional brethren, but which differs from them in a principled methodological way. Hence, no attempts are made to improve on existing theories empirically. Nevertheless, as we indicate in section 5, the development of a compositional alternative may in the end have empirical consequences, too. First of all, it can be argued that the dynamic view on interpretation developed in this paper suggests natural and relatively easy to formulate extensions which enable one to deal with a wider range of phenomena than can be dealt with in existing theories. Moreover, the various approaches to the model-theoretic semantics of discourse that have been developed during the last decade, have constituted a ‘fresh start’ in the sense that much of what had been accomplished before was ignored, at least for a start. Of course, this is a justified strategy if one feels one is trying to develop a radically different approach to recalcitrant problems. However, there comes a time when such new approaches have to be compared with the older one, and when an assessment of the pros and cons of each has to be made. One of the main problems in semantics today, we feel, is that a semantic theory such as Montague grammar, and an approach like Kamp’s discourse representation theory, are hard to compare, let alone that it is possible to unify their insights and results.. (shrink)

• 1st try: Free variables in PL (Predicate Logic) (1) Jim1 came in. He1 sat down. (antecedent Jim1 … anaphoric he1) |=M, g cm ιx(x = z1  z1 = jim)  sit z1 iff g(z1) ∈ cm & g(z1) = jim & g(z1) ∈ sit.

In this paper we introduce a notion of context for Groenendijk & Stokhof's Dynamic Predicate Logic DPL. We use these contexts to give a characterization of the relations on assignments that can be generated by composition from tests and random resettings in the case that we are working over an infinite domain. These relations are precisely the ones expressible in DPL if we allow ourselves arbitrary tests as a starting point. We discuss some possible extensions of DPL (...) and the way these extensions interact with our notion of context. (shrink)

In this paper a semantics for dynamic predicate logic is developed that uses sequence valued assignments. This semantics is compared with the usual relational semantics for dynamic predicate logic: it is shown that the most important intuitions of the usual semantics are preserved. Then it is shown that the refined semantics reflects out intuitions about information growth. Some other issues in dynamic semantics are formulated and discussed in terms of the new sequence semantics.

The core language can be extended by defining additional logical constants. E.g., we can add ‘→’ (implication), ‘∨’ (disjunction), and ‘∀x’ (universal quantifiers). The choice of logical primitives is not as optional in DPL as it is in standard predicate logic.

A new formalism for predicate logic is introduced, with a non-standard method of binding variables, which allows a compositional formalization of certain anaphoric constructions, including donkey sentences and cross-sentential anaphora. A proof system in natural deduction format is provided, and the formalism is compared with other accounts of this type of anaphora, in particular Dynamic Predicate Logic.

Noun phrases with overt determiners, such as <i>some apples</i> or <i>a quantity of milk</i>, differ from bare noun phrases like <i>apples</i> or <i>milk</i> in their contribution to aspectual composition. While this has been attributed to syntactic or algebraic properties of these noun phrases, such accounts have explanatory shortcomings. We suggest instead that the relevant property that distinguishes between the two classes of noun phrases derives from two modes of existential quantification, one of which holds the values of a variable fixed (...) throughout a quantificational context while the other allows them to vary. Inspired by Dynamic Plural Logic and Dependence Logic, we propose Plural Predicate Logic as an extension of Predicate Logic to formalize this difference. We suggest that temporal <i>for</i>-adverbials are sensitive to aspect because of the way they manipulate quantificational contexts, and that analogous manipulations occur with spatial <i>for</i>-adverbials, habituals, and the quantifier <i>all</i>. (shrink)

In this paper we prove that the principles in the languagewith relation composition and dynamic implication, valid forall binary relations, are the same ones as the principlesvalid when we restrict ourselves to DPL-relations,i.e. relations generated from conditions (tests) and resettings.

Dynamic predicate logic (DPL), presented in [5] as a formalism for representing anaphoric linking in natural language, can be viewed as a fragment of a well known formalism for reasoning about imperative programming [6]. An interesting difference from other forms of dynamic logic is that the distinction between formulas and programs gets dropped: DPL formulas can be viewed as programs. In this paper we show that DPL is in fact the basis of a hierarchy of (...) formulas-as-programs languages. (shrink)

We introduce a substructural propositional calculus of Sequential Dynamic Logic that subsumes a propositional part of dynamic predicate logic, and is shown to be expressively equivalent to propositional dynamic logic. Completeness of the calculus with respect to the intended relational semantics is established.

We consider algebras on binary relations with two main operators: relational composition and dynamic negation. Relational composition has its standard interpretation, while dynamic negation is an operator familiar to students of Dynamic Predicate Logic (DPL) (Groenendijk and Stokhof, 1991): given a relation R its dynamic negation R is a test that contains precisely those pairs (s,s) for which s is not in the domain of R. These two operators comprise precisely the propositional part of (...) DPL.This paper contains a finite equational axiomatization for these dynamic relation algebras. The completenessresult uses techniques from modal logic. We also lookat the variety generated by the class of dynamic relation algebras and note that there exist nonrepresentable algebras in this variety, ones which cannot be construedas spaces of relations. These results are also proved for an extension to a signature containing atomic tests and union. (shrink)

Dynamic Predicate Logic (DPL) is a variant of Predicate Logic introduced by Groenendijk and Stokhof. One rationale behind the introduction of DPL is that it is closer to Natural Language than ordinary Predicate Logic in the way it treats scope.In this paper I develop some variants of DPL that can more easily approximate Natural Language in some further aspects. Specifically I add flexibility in the treatment of polarity and and some further flexibility in (...) the treatment of scope.I develop a framework that is intended to encourage further experimentation with alternative variants of DPL. In this framework the new meanings are, roughly,indexed sets of old meanings. The indices can be viewed as "files'' or "storage devices.''Each such file supports a separate "information stream.''The interaction of the new meanings is "programmed'' with the help of certain monoids acting on the indices. The construction of the new meanings can be viewed as an application of the Grothendieck Construction to monoids. (shrink)

In Groenendijk & Stokhof [1989] a system of dynamic predicate logic (DPL) was developed, as a compositional alternative for classical discourse representation theory (DRT ). DPL shares with DRT the restriction of being a first-order system. In the present paper, we are mainly concerned with overcoming this limitation. We shall define a dynamic semantics for a typed language with λ-abstraction which is compatible with the semantics DPL specifies for the language of first-order predicate logic. (...) We shall propose to use this new logical system as the semantic component of a Montague-style grammar (referred to as dynamic Montague grammar, DMG), which will enable us to extend the compositionality of DPL to the subsentential level. Furthermore, we shall extend this analysis also in this sense that we shall add new, dynamic interpretations for logical constants which in DPL were treated in a static fashion. This will substantially increase the descriptive coverage of DMG. (shrink)

In this paper we present stable and unstable versions of several well-known relations from mereotopology: part-of, overlap, underlap and contact. An intuitive semantics is given for the stable and unstable relations, describing them as dynamic counterparts of the base mereotopo-logical relations. Stable relations are described as ones that always hold, while unstable relations hold sometimes. A set of first-order sentences is provided to serve as axioms for the stable and unstable relations, and representation theory is developed in similar fashion (...) to Stone’s representation theory for Boolean algebras and distributive lattices. Then we present some results about the first-order predicate logic of these relations and about its quantifier-free fragment. Completeness theorems for these logics are proved, the full first-order theory is proved to be hereditary undecidable and the satisfiability problem of the quantifier-free fragment is proved to be NP-complete. (shrink)

This thesis investigates two main issues concerning the behavior of rational agents, preference dynamics and agent diversity. -/- We take up two questions left aside by von Wright, and later also the multitude of his successors, in his seminal book Logic of Preference in 1963: reasons for preference, and changes in preference. Various notions of preference are discussed, compared and further correlated in the thesis. In particular, we concentrate on extrinsic preference. Contrary to intrinsic preference, extrinsic preference is reason-based, (...) i.e. one's preference for one option over another has a reason. A logical model is proposed and its properties are determined. Dynamics come in naturally, since reasons for the preferences can change. Logical systems and formal results regarding dynamical preference change are then presented. -/- Preference arises from comparisons between alternatives. A first option is to compare situations. Abstractly speaking, preferences are in this case between propositions, viewed as sets of possible worlds. The reasons can then be based on a `betterness' relation over possible worlds. Propositional preference arises as a lift from this primitive relation. A standard modal logical approach is taken and we use a modality for the betterness relation in the language. We then model preference change by techniques from dynamic epistemic logic (DEL), where a typical action, e.g. a suggestion or a command can change the betterness ordering of the worlds, and thereby the propositional preference. Dynamic reduction axioms are obtained to encode exactly how such a change takes place. We obtain a complete dynamic preference logic. -/- A second option is to compare objects as such. Concretely, properties of the objects often determine the preference over the objects. Properties are now the reasons. Inspired by Optimality Theory (OT), we propose a priority sequence, an ordering of properties. Various ways of getting a preference from the priority sequence are investigated, though we mostly follow the OT approach. We use a fragment of first-order logic to describe the situation. Here, on the dynamic side, it is priority change that leads to preference change. Using the DEL methodology again we propose a complete set of reduction axioms concerning the possible dynamic operations on priority sequences. -/- Not surprisingly, the above two views are closely related. After all, possible worlds can be thought of as objects! On the basis of a systematic comparison of the two views, we develop a two level perspective, in which the models themselves are structured in layers. In particular, correspondence results between the changes at the level of the possible worlds and the changes at the level of the priority sequences are proved. We end up by sketching a two-level preferential predicate logic to describe more complex circumstances in which situations and objects are compared simultaneously. -/- But we do not see this as the whole story. Preference does not live by itself, it is often intermingled with epistemic notions of knowledge and belief. One can have different intuitions about how this entanglement operates. A few options are discussed, and proposals for logical models are presented. When moving to dynamics, we now see a picture of knowledge update, belief revision and preference change taking place symbiotically, often unconsciously as in real life. -/- The resulting picture in the thesis is one of agents that process information and adjust beliefs and preferences in many different ways. There is no logically prescribed unique norm for doing this. The second part of the thesis takes this general phenomenon of diversity of agents as its focus, since it raises many issues for logical systems and the idealized agents which they normally presuppose. In reality, agents can differ across a wide spectrum of cognitive abilities and habits: in their memory capacity, observation power, inferential power, introspective ability, and revision policies when facing new information. -/- Two kinds of agents, perfect recall agents, and memory-free agents are studied thoroughly, in the setting of playing games. We show how current dynamic logics can be `parametrized' to allow for this memory diversity, with new characterizations of agent types resulting in complete dynamic-epistemic logics. The other dimension of the reality of diverse agents is that, however different they are, they often do manage to coordinate with each other successfully. While this theme has been prominent in game theory and multi-agent systems, it has received hardly any attention in logic. We analyze this interaction between different agents by looking at concrete scenarios which model their types explicitly. -/- Finally, we analyze the issue of agent diversity in its generality, discussing what dynamic logics would have to look like to become a full-fledged account of agents of different capacities and tendencies that pursue and sometimes achieve their goals in irreducibly social settings. -/- . (shrink)

In this paper we present a dynamic assignment language which extends the dynamic predicate logic of Groenendijk and Stokhof [1991: 39–100] with assignment and with generalized quantifiers. The use of this dynamic assignment language for natural language analysis, along the lines of o.c. and [Barwise, 1987: 1–29], is demonstrated by examples. We show that our representation language permits us to treat a wide variety of donkey sentences: conditionals with a donkey pronoun in their consequent and (...) quantified sentences with donkey pronouns anywhere in the scope of the quantifier. It is also demonstrated that our account does not suffer from the so-called proportion problem.Discussions about the correctness or incorrectness of proposals for dynamic interpretation of language have been hampered in the past by the difficulty of seeing through the ramifications of the dynamic semantic clauses (phrased in terms of input-output behaviour) in non-trivial cases. To remedy this, we supplement the dynamic semantics of our representation language with an axiom system in the style of Hoare. While the representation languages of barwise and Groenendijk and Stokhof were not axiomatized, the rules we propose form a deduction system for the dynamic assignment language which is proved correct and complete with respect to the semantics. (shrink)

We consider the variety of Dynamic Relation Algebras V(DRA). We show that the monoid of an algebra in this variety determines dynamic negation uniquely.

A new system of dynamic logic is introduced and motivated, witha novel approach to variable binding for incremental interpretation. Thesystem is shown to be equivalent to first order logic and complete.The new logic combines the dynamic binding idea from DynamicPredicate Logic with De Bruijn style variable free indexing. Quantifiersbind the next available variable register; the indexing mechanismguarantees that active registers are never overwritten by newquantifiers actions. Apart from its interest in its own right, theresulting (...) system has certain advantages over Dynamic Predicate Logic orDiscourse Representation Theory. It comes with a more well behaved(i.e., transitive) consequence relation, it gives a more explicitaccount of how anaphoric context grows as text gets processed, and ityields new insight into the dynamics of anaphoric linking in reasoning.Incremental dynamics also points to a new way of handling contextdynamically in Montague grammar. (shrink)

I discuss the foundations of predicate ontologies based on two model notions – elementary states of affairs and eventualities, i.e. ordered pairs of initial and end states of affairs. Vendlerian classifications are oriented towards elementary states and tense logic, while Davidsonian classifications deal with eventualities and event logic. There are two kinds of atemporal predicates - fact and properties. Facts are propositional arguments of second-order predicates which add a special meaning that the embedded proposition was verified. Properties (...) are atemporal first-order predicates that lack eventive interpretation and are not associated with factive frames. Davidsonian states are homogeneous durable spatiotemporal things distinct both from atemporal properties and spatiotemporal dynamic predicates. Davidsonian states are causally independent, while resultatives are causally determined as they reconstruct a preceding event that has caused the end state p. I discuss the contrast between external and internal Davidsonian states. The former lack a priority argument and can be quantified extensionally. The latter have a priority experiential argument and can only be quantified intensionally. External states can be observed, while internal states cannot. (shrink)

This volume addresses current issues in the semantics and the pragmatics of discourse and dialogue. Collected papers aim at providing insights on different theoretical approaches, all of them in the dynamic semantics tradition, such as Dynamic Predicate Logic (DPL), Discourse Representation Theory (DRT), and Segmented Discourse Representation Theory (SDRT). They reflect the current move of formal semantics from short multisentential texts towards structured discourses and dialogues, accounting for more and more phenomena at the semantics-pragmatics interface (e.g., (...) subtleties of anaphora and presupposition, the role of temporal connectives in discourse or the establishment of common references in dialogue). (shrink)

In this paper, I show that the availability of what some authors have called the weak reading and the strong reading of donkey sentences with relative clauses is systematically related to monotonicity properties of the determiner. The correlation is different from what has been observed in the literature in that it concerns not only right monotonicity, but also left monotonicity (persistence/antipersistence). I claim that the reading selected by a donkey sentence with a double monotone determiner is in fact the one (...) that validates inference based on the left monotonicity of the determiner. This accounts for the lack of strong reading in donkey sentences with MON determiners, which have been neglected in the literature. I consider the relevance of other natural forms of inference as well, but also suggest how monotonicity inference might play a central role in the actual process of interpretation. The formal theory is couched in dynamic predicate logic with generalized quantifiers. (shrink)

This volume brings together a group of logic-minded philosophers and philosophically oriented logicians to address a diversity of topics on the structural analysis of non-classical logics. It mainly focuses on the construction of different types of models for various non-classical logics of current interest, including modal logics, epistemic logics, dynamic logics, and observational predicate logic. The book presents a wide range of applications of two well-known approaches in current research: structural modeling of certain philosophical issues in (...) the framework of non-classic logics, such as admissible models for modal logic, structural models for modal epistemology and for counterfactuals, and epistemological models for common knowledge and for public announcements; conceptual analysis of logical properties of, and formal semantics for, non-classical logics, such as sub-formula property, truthmaking, epistemic modality, behavioral strategies, speech acts and assertions. The structural analysis provided in this volume will appeal not only to graduate students and experts in non-classic logics, but also to readers from a wide range of disciplines, including computer science, cognitive science, linguistics, game theory and theory of action, to mention a few. (shrink)

We provide examples of plurals related to ambiguity and anaphora that pose problems or are counterexamples for current approaches to plurals. We then propose a dynamic semantics based on an extension of dynamic predicate logic to handle these examples. On our theory, different readings of sentences or discourses containing plurals don’t arise from a postulated ambiguity of plural terms or predicates applying to plural DPs, but follow rather from different types of dynamic transitions that manipulate (...) inputs and outputs from formulas or discourse constituents. Many aspects of meaning can affect the type dynamic transitions: the lexical semantics of predicates to the left and right of a transition, and number features of DPs and discourse constraints like parallelism. (shrink)

Thinking about Martin Stokhof as a philosopher and colleague, his formal analysis (together with Jeroen Groenendijk) of questions and question answering is the first thing that comes to mind. This work is part of a fruitful tradition that has recently spawned inquisitive semantics, and the focus on question answering in dynamic epistemic logic. The theme is still very much alive at ILLC today. Next, I am reminded of the dynamic turn in natural language semantics, of the way (...) he and Jeroen Groenendijk criticized Hans Kamp’s ideas about discourse representation, and how this led to the invention of dynamic predicate logic. Later it became clear that dynamic predicate logic can be viewed as the action part of quantified dynamic logic, invented much earlier by David Harel. This led to a connection, a semantic parallel, between the analysis of programming and the analysis of natural language. Thinking about Martin as a philosopher still longer, it is impossible to further postpone the thought of Ludwig Wittgenstein. This is the connection that I am least familiar with, so this is what I will write about, in the hope that developing my thought in writing will create a somewhat better understanding. (shrink)

Binding relations are fimdamentally semantic in nature. They arise as relations that are established with an interpretation. This is most apparent with dynamic binding, of the kind found in Dynamic Predicate Logic. Here it is the runtime of the evaluation that may permit a binding relation, in..

Destructive assignment is the main weakness of Dynamic Predicate Logic (DPL, [GS91], but see also [Bar87]) as a basis for a compositional semantics of natural language: in DPL, the semantic effect of a quantifier action ∃x is that the previous value of x gets lost forever.

We show in this paper that some expressions indicating source of evidence are part of propositional content and are best analyzed as special kind of epistemic modal. Our evidence comes from the Japanese evidential system. We consider six evidentials in Japanese, showing that they can be embedded in conditionals and under modals and that their properties with respect to modal subordination are similar to those of ordinary modals. We show that these facts are difficult for existing theories of evidentials, which (...) assign evidentials necessarily widest scope, to explain. We then provide an analysis using a logical system designed to account for evidential reasoning; this logic is the first developed system of probabilistic dynamic predicate logic. This analysis is shown to account for the data we provide that is problematic for other theories. (shrink)

The article presents several adaptive fuzzy hedge logics . These logics are designed to perform a specific kind of hedge detection. Given a premise set Γ that represents a series of communicated statements, the logics can check whether some predicate occurring in Γ may be interpreted as being (implicitly) hedged by technically , strictly speaking or loosely speaking , or simply non-hedged. The logics take into account both the logical constraints of the premise set as well as conceptual information (...) concerning the meaning of potentially hedged predicates (stored in the memory of the interpreter in question). The proof theory of the logics is non-monotonic in order to enable the logics to deal with possible non-monotonic interpretation dynamics (this is illustrated by means of several concrete proofs). All the adaptive fuzzy hedge logics are also sound and strongly complete with respect to their [0,1]-semantics. (shrink)

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)

The aim of the paper is to evaluate the prospects for an aesthetically informed assessment-sensitive semantic account of thick aesthetic predicates (TAPs) such as 'intense', 'sombre', ‘balanced’, ‘harmonious’, etc. We distinguish two meaning dimensions concerning TAPs, truth-conditional and use-conditional or expressive, and provide a dualist semantics that posits assessment sensitivity at both levels. Then we evaluate the extent to which assessment sensitivity is an apt rendition of aesthetic discourse involving TAPs. We distinguish between experiential TAPs (‘intense’, ‘sombre’) and theoretical TAPs (...) (‘balanced’, ‘dynamic’), and argue that there is evidence for a relativistic construal both at the truth-conditional and the expressive level for experiential TAPs, but not for theoretical TAPs. Thus, an upper bound is found on how much assessment sensitivity characterises aesthetic discourse. (shrink)

Epistemic modal predicate logic raises conceptual problems not faced in the case of alethic modal predicate logic : Frege’s “Hesperus-Phosphorus” problem—how to make sense of ascribing to agents ignorance of necessarily true identity statements—and the related “Hintikka-Kripke” problem—how to set up a logical system combining epistemic and alethic modalities, as well as others problems, such as Quine’s “Double Vision” problem and problems of self-knowledge. In this paper, we lay out a philosophical approach to epistemic predicate (...) logic, implemented formally in Melvin Fitting’s First-Order Intensional Logic, that we argue solves these and other conceptual problems. Topics covered include: Quine on the “collapse” of modal distinctions; the rigidity of names; belief reports and unarticulated constituents; epistemic roles; counterfactual attitudes; representational vs. interpretational semantics; ignorance of co-reference vs. ignorance of identity; two-dimensional epistemic models; quantification into epistemic contexts; and an approach to multi-agent epistemic logic based on centered worlds and hybrid logic. (shrink)

We show in this paper that some expressions indicating source of evidence are part of propositional content and are best analyzed as special kind of epistemic modal. Our evidence comes from the Japanese evidential system. We consider six evidentials in Japanese, showing that they can be embedded in conditionals and under modals and that their properties with respect to modal subordination are similar to those of ordinary modals. We show that these facts are difficult for existing theories of evidentials, which (...) assign evidentials necessarily widest scope, to explain. We then provide an analysis using a logical system designed to account for evidential reasoning; this logic is the first developed system of probabilistic dynamic predicate logic. This analysis is shown to account for the data we provide that is problematic for other theories. (shrink)

Semantics: A Reader contains a broad selection of classic articles on semantics and the semantics/pragmatics interface. Comprehensive in the variety and breadth of theoretical frameworks and topics that it covers, it includes articles representative of the major theoretical frameworks within semantics, including: discourse representation theory, dynamic predicate logic, truth theoretic semantics, event semantics, situation semantics, and cognitive semantics. All the major topics in semantics are covered, including lexical semantics and the semantics of quantified noun phrases, adverbs, adjectives, (...) performatives, and interrogatives. Included are classic papers in the field of semantics as well as papers written especially for the volume. The volume comes with an extensive introduction designed not only to provide an overview of the field, but also to explain the technical concepts the beginner will need to tackle before the more demanding articles. Semantics will have appeal as a textbook for upper level and graduate courses and as a reference for scholars of semantics who want the classic articles in their field in one convenient place. (shrink)

We consider substitutions in order sensitive situations, having in the back of our minds the case of dynamic predicate logic (DPL) with a stack semantics. We start from the semantic intuition that substitutions are move instructions on stacks: the syntactic operation [y/x] is matched by the instruction to move the value of the y-stack to the x-stack. We can describe these actions in the positive fragment of DPLE. Hence this fragment counts as a logic for DPL-substitutions. (...) We give a calculus for the fragment and prove soundness and completeness. (shrink)

We generalize stochastic Kripke models and Markov transition systems to stochastic right coalgebras. These are coalgebras for a functor with as an endofunctor on the category of analytic spaces, and is the subprobability functor. The modal operators are generalized through predicate liftings which are set-valued natural transformations involving the functor. Two states are equivalent iff they cannot be separated by a formula. This equivalence relation is used to construct a cospan for logical equivalent coalgebras under a separation condition for (...) the set of predicate liftings. Consequently, behavioral and logical equivalence are really the same. From the cospan we construct a span. The central argument is a selection argument giving us the dynamics of a mediating coalgebra from the domains of the cospan. This construction is used to establish that behavioral equivalent coalgebras are bisimilar, yielding the equivalence of all three characterizations of a coalgebra’s behavior as in the case of Kripke models or Markov transition systems. (shrink)

One of the aims of phenomenology was to uncover a logic of the sensible world. This essay shows how rhythm can be understood as a logic of the sensible world and how rhythm is not only a profoundly aesthetic experience but one integral to phenomenological reflection. The essay highlights how aesthetic experiences accomplish phenomenological reductions and how phenomenological reflection demands a continued inquiry into the ways intelligibility first opens from within the sensible world. Rhythm is shown to be (...) a preverbal logic and expressive power that takes place between sensing and the sensible. The essay explores how art and phenomenology draw upon rhythms to bring forth senses of experience that normally get passed over and escape conceptual determination. The investigation digs beneath predicated experience and propositional language to reveal how rhythm is a preverbal mode of inquiry that takes place between solicitations made by the sensible and the body’s sensitive responsiveness. Rhythm establishes an original synchronic relation to sensible things that allows nascent forms of intelligibility to come into a dynamic and living clarity. However, rhythms comprise a latent form of intentionality that precedes the act-object schema of intentionality. As a form of intentionality rooted in the senses, rhythm is shown to be a mode of transport that effectuates absorptive experiences which pose unique challenges for phenomenological reflection and aesthetic theory. Nonetheless, rhythm helps clarify one way in which sources of intelligibility not only grow out of the sensible world but retain an enduring aesthetic quality. (shrink)

One of the aims of phenomenology was to uncover a logic of the sensible world. This essay shows how rhythm can be understood as a logic of the sensible world and how rhythm is not only a profoundly aesthetic experience but one integral to phenomenological reflection. The essay highlights how aesthetic experiences accomplish phenomenological reductions and how phenomenological reflection demands a continued inquiry into the ways intelligibility first opens from within the sensible world. Rhythm is shown to be (...) a preverbal logic and expressive power that takes place between sensing and the sensible. The essay explores how art and phenomenology draw upon rhythms to bring forth senses of experience that normally get passed over and escape conceptual determination. The investigation digs beneath predicated experience and propositional language to reveal how rhythm is a preverbal mode of inquiry that takes place between solicitations made by the sensible and the body’s sensitive responsiveness. Rhythm establishes an original synchronic relation to sensible things that allows nascent forms of intelligibility to come into a dynamic and living clarity. However, rhythms comprise a latent form of intentionality that precedes the act-object schema of intentionality. As a form of intentionality rooted in the senses, rhythm is shown to be a mode of transport that effectuates absorptive experiences which pose unique challenges for phenomenological reflection and aesthetic theory. Nonetheless, rhythm helps clarify one way in which sources of intelligibility not only grow out of the sensible world but retain an enduring aesthetic quality. (shrink)

The article presents several adaptive fuzzy hedge logics. These logics are designed to perform a specific kind of hedge detection. Given a premise set Γ that represents a series of communicated statements, the logics can check whether some predicate occurring in Γ may be interpreted as being (implicitly) hedged by technically, strictly speaking or loosely speaking, or simply non-hedged. The logics take into account both the logical constraints of the premise set as well as conceptual information concerning the meaning (...) of potentially hedged predicates (stored in the memory of the interpreter in question). The proof theory of the logics is non-monotonic in order to enable the logics to deal with possible non-monotonic interpretation dynamics (this is illustrated by means of several concrete proofs). All the adaptive fuzzy hedge logics are also sound and strongly complete with respect to their [0,1]-semantics. (shrink)

The article presents several adaptive fuzzy hedge logics. These logics are designed to perform a specific kind of hedge detection. Given a premise set Γ that represents a series of communicated statements, the logics can check whether some predicate occurring in Γ may be interpreted as being (implicitly) hedged by technically, strictly speaking or loosely speaking, or simply non-hedged. The logics take into account both the logical constraints of the premise set as well as conceptual information concerning the meaning (...) of potentially hedged predicates (stored in the memory of the interpreter in question). The proof theory of the logics is non-monotonic in order to enable the logics to deal with possible non-monotonic interpretation dynamics (this is illustrated by means of several concrete proofs). All the adaptive fuzzy hedge logics are also sound and strongly complete with respect to their [0,1]-semantics. (shrink)

The aim of this paper is to introduce the logics $$\textit{FFDE}$$ and $$\textit{FN}{4}$$, which are universally free versions of Belnap-Dunn’s four-valued logic, also known as the logic of first-degree entailment ( $$\textit{FDE}$$ ), and Nelson’s paraconsistent logic $$N^{-}$$ (a.k.a. $$Q\!N {4}$$ ). Both $$\textit{FDE}$$ and $$Q\!N {4}$$ are suitable to be interpreted as information-based logics, that is, logics that are capable of representing the deductive behavior of possibly inconsistent and incomplete information in a database. Like $$Q\!N {4}$$ (...) and some non-free first-order extensions of $$\textit{FDE}$$, $$\textit{FFDE}$$ and $$\textit{FN}{4}$$ are endowed with Kripke-style variable domain semantics, which allows representing the dynamic aspect of information processing, that is, how a database receives new information over time, including information about new individuals. We argue, however, that $$\textit{FFDE}$$ and $$\textit{FN}{4}$$ can better represent the development of inconsistent and incomplete information states (i.e., configurations of a database) over time than their non-free versions. First, because they allow for empty domains, which corresponds to the idea that a database may acknowledge no individual at all at an early stage of its development. Second, because they allow for empty names, which get interpreted as information about new individuals is inserted into the database. Also, both systems include an identity predicate that is interpreted along the same lines of the other logical operators, viz., in terms of independent positive and negative rules. (shrink)

According to the standard view of particularity, an entity is a particular just in case it necessarily has a unique spatial location at any time of its existence. That the basic entities of the world we speak about in common sense and science are particular entities in this sense is the thesis of “foundational particularism,” a theoretical intuition that has guided Western ontological research from its beginnings to the present day. The main aim of this paper is to review the (...) notion of particularity and its role in ontology. I proceed in four steps. First, I offer a brief reconstruction of the tasks of ontology as “theory of categorial inference in L”. An ontological theory states which (combinations of) entity types or categories make true L-sentences true; the features of the stipulated categories explain why L-speakers are entitled to draw certain material inferences from the classificatory expressions of L. Second, I draw attention to the fact that since Aristotle this theoretical program typically has been implemented with peculiar restrictions prescribing certain combinations of category features, e.g., the combination of particularity, concreteness, individuality, and subjecthood. I briefly sketch how these restrictions of the “substance paradigm” or “myth of substance” are reinforced by the standard readings of predicate-logical constants, viz. the existential quantifier and the identity sign. Third, I argue that in the context of the substance paradigm foundational particularism is incoherent. I discuss the current standard conceptions of particulars as developed in the debate about individuation (bare particulars, nude particulars, tropes) and show that their main difficulties derive from the traditional restriction that particulars are so also logical subjects and/or individuals. Fourth, to show that the traditional linkages of category features are not conceptual necessities, I sketch the outlines of an ontology (General Process Theory) based on non-particular individuals. For ontologists in computer science working with description logic this monocategoreal ontology based on more or less generic ‘dynamics’ may hold special interest. As General Process Theory documents, ontologists may well abandon the notion of particularity: in common sense and science we do reason about items that have a unique spatial location at any time, but the uniqueness of their location can be taken to be a contingent affair. (shrink)

Dynamic Epistemic Logic is the logic of knowledge change. This book provides various logics to support such formal specifications, including proof systems. Concrete examples and epistemic puzzles enliven the exposition. The book also offers exercises with answers. It is suitable for graduate courses in logic. Many examples, exercises, and thorough completeness proofs and expressivity results are included. A companion web page offers slides for lecturers and exams for further practice.

We develop a predicate logical extension of a subintuitionistic propositional logic. Therefore a Hilbert type calculus and a Kripke type model are given. The propositional logic is formulated to axiomatize the idea of strategic weakening of Kripke''s semantic for intuitionistic logic: dropping the semantical condition of heredity or persistence leads to a nonmonotonic model. On the syntactic side this leads to a certain restriction imposed on the deduction theorem. By means of a Henkin argument strong completeness (...) is proved making use of predicate logical principles, which are only classically acceptable. (shrink)

Presuppositions of utterances are the pieces of information you convey with an utterance no matter whether your utterance is true or not We rst study presupposition in a very simple framework of updating propo sitional information with examples of how presuppositions of complex propositional updates can be calculated Next we move on to presupposi tions and quanti cation in the context of a dynamic version of predicate logic suitably modi ed to allow for presupposition failure In both (...) the propositional and the quanti cational case presupposition failure can be viewed as error abortion of procedures Thus a dynamic assertion logic which describes the preconditions for error abortion is the suitable tool for analysing presupposition.. (shrink)

The paper presents predicate logical extensions of some subintuitionistic logics. Subintuitionistic logics result if conditions of the accessibility relation in Kripke models for intuitionistic logic are dropped. The accessibility relation which interprets implication in models for the propositional base subintuitionistic logic considered here is neither persistent on atoms, nor reflexive, nor transitive. Strongly complete predicate logical extensions are modeled with a second accessibility relation, which is a partial order, for the interpretation of the universal quantifier.

Predicates are supposed to slice reality neatly in two halves, one for which the predicate holds, the other for which it fails. Yet far from being razors, predicates tend to be dull knives that mangle reality. If reality is a tomato and predicates are knives, then when these knives divide the tomato, plenty of mush remains unaccounted for. Of course some knives are sharper than others, just as some predicates are less vague than others. “x is water” is certainly (...) sharper than “x is beautiful.” But perfect sharpness, perfect boundaries, and perfect separation seem only to obtain in mathematics. The vagueness inherent in many predicates became particularly evident in the twentieth century. Quantum mechanics, the revival of certain ancient paradoxes, and the philosophy of science all contributed to a growing awareness that vagueness was ineliminable from many predicates. Quantum mechanical superposition seems to allow mutually exclusive simultaneous states. In searching for plausible interpretations of quantum mechanics, some researchers attempted to do away with classical bivalent logic. In its place they substituted multivalent quantum logics. Any logic with more than two values forces its predicates to slice reality into more than two parts. Ancient paradoxes involving heaps and baldness also pointed up the 1 Random Predicate Logic 2.. (shrink)

D2.1 (PL models and assignments) i. A PL model is a pair M = 〈DM, ·M〉 such that (a) DM is a non-empty set, and (b) ·M maps each A ∈ Con to AM ∈ DM, and each B ∈ Prdn to BM  (DM)n. ii. GM = {g| g: Var  DM} is the set of M-assignments. For any g ∈ GM, u ∈ Var, d ∈ DM, g[u/d] := (g\{u, g(u)})  {u, d} is the u-to-d alternative to (...) g. (shrink)