In [BAT 00b], the flat Rescher–Manor consequence relations — the Free, Strong, Argued, C-Based, andWeak consequence relation—were shown to be characterized by inconsistency-adaptive logics defined from the paraconsistent logic CLuN. This provided these consequence relations with a dynamic proof theory. In the present paper we show that the detour via an inconsistency-adaptive logic is not necessary. We present a direct dynamic proof theory, formulated in the language of Classical Logic, and prove its adequacy. The present paper contains the (...) first direct dynamic proof theory for consequence relations that are characterized by an adaptive logic. (shrink)

In this paper we provide a proof theoretical investigation of logical argumentation, where arguments are represented by sequents, conflicts between arguments are represented by sequent elimination rules, and deductions are made by dynamic proof systems extending standard sequent calculi. The idea is to imitate argumentative movements in which certain claims are introduced or withdrawn in the presence of counter-claims. This is done by a dynamic evaluation of sequences of sequents, in which the latter are considered ‘derived’ or ‘not (...) derived’ according to the content of the sequence. We show that decisive conclusions of such a process correspond to well-accepted consequences of the underlying argumentation framework. The outcome is therefore a general and modular proof-theoretical approach for paraconsistent and non-monotonic reasoning with argumentation systems. (shrink)

A famous theorem by van der Waerden states the following: Given any finite coloring of the integers, one color contains arbitrarily long arithmetic progressions. Equivalently, for every q,k, there is an N = N(q,k) such that for every q-coloring of an interval of length N one color contains a progression of length k. An obvious question is what is the growth rate of N = N(q,k). Some proofs, like van der Waerden's combinatorial argument, answer this question directly, while the (...) topological proof by Furstenberg and Weiss does not. We present an analysis of (Girard's variant of) Furstenberg and Weiss's proof based on monotone functional interpretation, both yielding bounds and providing a general illustration of proof mining in topological dynamics. The bounds do not improve previous results by Girard, but only—as is also revealed by the analysis—because the combinatorial proof and the topological dynamics proof in principle are identical. (shrink)

The present article provides an analysis of the existing proof systems for dynamic epistemic logic from the viewpoint of proof-theoretic semantics. Dynamic epistemic logic is one of the best known members of a family of logical systems that have been successfully applied to diverse scientific disciplines, but the proof-theoretic treatment of which presents many difficulties. After an illustration of the proof-theoretic semantic principles most relevant to the treatment of logical connectives, we turn to illustrating the main features of (...) display calculi, a proof-theoretic paradigm that has been successfully employed to give a proof-theoretic semantic account of modal and substructural logics. Then, we review some of the most significant proposals of proof systems for dynamic epistemic logics, and we critically reflect on them in the light of the previously introduced proof-theoretic semantic principles. The contributions of the present article include a generalization of Belnap's cut-elimination metatheorem for display calculi, and a revised version of the display-style calculus D.EAK. We verify that the revised version satisfies the previously mentioned proof-theoretic semantic principles, and show that it enjoys cut-elimination as a consequence of the generalized metatheorem. (shrink)

Dynamic and proof-conditional approaches to discourse (exemplified by Discourse Representation Theory and Type-Theoretical Grammar, respectively) are related through translations and transitions labeled by first-order formulas with anaphoric twists. Type-theoretic contexts are defined relative to a signature and instantiated modeltheoretically, subject to change.

ABSTRACT Propositional dynamic logic with converse and test, is enriched with complement, intersection and relational operations of weakest prespecification and weakest postspecification. Relational deduction system for the logic is given based on its interpretation in the relational calculus. Relational interpretation of the operators ?repeat? and ?loop? is given.

This paper spells out a dynamic proof format for the pure logic of relevant implication. (A proof is dynamic if a formula derived at some stage need not be derived at a later stage.) The paper illustrates three interesting points. (i) A set of properties that characterizes an inference relation on the (very natural) dynamic proof interpretation, need not characterize the same inference relation (or even any inference relation) on the usual settheoretical interpretation. (ii) A proof format (...) may display an internal dynamics (defeasible conclusions) in the absence of an external dynamics (non-monotonicity). (iii) A monotonic logic may have a non-monotonic characterization. (shrink)

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.

Since Plaza [1989], which is most of the time considered as the inaugural paper on announcement logics in public communication contexts, a lot of papers on dynamic epistemic logics have been published. The most famous dynamic epistemic logic is known by the name of PAL (Public Announcement Logic). The logic PAC is an extension of PAL with the common knowledge operator (CG). Soundness and completeness proofs of those logics are presented in van Ditmarsch et al. [2008], in (...) Balbiani et al. [2010] and in de Boer [2007]. Each of them used either a model-theoretic approach or a tableaux calculus. In the present paper, we propose an alternative approach to PAC based on the dialogical framework. (shrink)

This thesis provides an analysis of the existing proof systems for dynamic epistemic logic from the viewpoint of proof-theoretic semantics. After an illustration of the basic principles of proof-theoretic semantics, we review some of the most significant proposals of proof systems for dynamic epistemic logics, and we critically reject on them in the light of proof-theoretic semantic principles. The main original contributions of the present thesis are: (a) a revised version of the display-style calculus D.EAK, which we argue (...) to be more adequate from the proof-theoretic semantic viewpoint; the main feature of this revision is that a smoother proof (so-called Belnap-style) of cut-elimination holds for it, which is problematic for the original version of D.EAK. (b) The intro duction of a novel, multi-type display calculus for dynamic epistemic logic, which we refer to as Dynamic Calculus. The presence of types endows the language of the Dynamic Calculus with additional expressivity, and makes it possible to design rules with an even smoother behavior. We argue that this calculus paves the way towards a general methodology for the design of proof systems for the generality of dynamic logics, and certainly for proof systems beyond dynamic epistemic logic. We prove that the Dynamic Calculus adequately captures Baltag-Moss-Solecki's dynamic epistemic logic, and enjoys Belnap-style cut elimination. (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.

In this paper I combine the dynamic epistemic logic ofGerbrandy (1999) with the probabilistic logic of Fagin and Halpern (1994). The resultis a new probabilistic dynamic epistemic logic, a logic for reasoning aboutprobability, information, and information change that takes higher orderinformation into account. Probabilistic epistemic models are defined, and away to build them for applications is given. Semantics and a proof systemis presented and a number of examples are discussed, including the MontyHall Dilemma.

We give a general method for producing various effective Null and Positivstellensätze, and getting new Positivstellensätze in algebraically closed valued fields and ordered groups. These various effective Nullstellensätze produce algebraic identities certifying that some geometric conditions cannot be simultaneously satisfied. We produce also constructive versions of abstract classical results of algebra based on Zorn's lemma in several cases where such constructive version did not exist. For example, the fact that a real field can be totally ordered, or the fact that (...) a field can be embedded in an algebraically closed field. Our results are based on the concepts we develop of dynamical proofs and simultaneous collapse. (shrink)

The picture of information acquisition as the elimination of possibilities has proven fruitful in many domains, serving as a foundation for formal models in philosophy, linguistics, computer science, and economics. While the picture appears simple, its formalization in dynamic epistemic logic reveals subtleties: given a valid principle of information dynamics in the language of dynamic epistemic logic, substituting complex epistemic sentences for its atomic sentences may result in an invalid principle. In this article, we explore such failures of (...) uniform substitution. First, we give epistemic examples inspired by Moore, Fitch, and Williamson. Second, we answer affirmatively a question posed by van Benthem: can we effectively decide when every substitution instance of a given dynamic epistemic principle is valid? In technical terms, we prove the decidability of this schematic validity problem for public announcement logic (PAL and PAL-RC) over models for finitely many fully introspective agents, as well as models for infinitely many arbitrary agents. The proof of this result illuminates the reasons for the failure of uniform substitution. (shrink)

In 2004 Atserias, Kolaitis, and Vardi proposed $\text {OBDD}$ -based propositional proof systems that prove unsatisfiability of a CNF formula by deduction of an identically false $\text {OBDD}$ from $\text {OBDD}$ s representing clauses of the initial formula. All $\text {OBDD}$ s in such proofs have the same order of variables. We initiate the study of $\text {OBDD}$ based proof systems that additionally contain a rule that allows changing the order in $\text {OBDD}$ s. At first we consider a (...) proof system $\text {OBDD}$ that uses the conjunction rule and the rule that allows changing the order. We exponentially separate this proof system from $\text {OBDD}$ proof system that uses only the conjunction rule. We prove exponential lower bounds on the size of $\text {OBDD}$ refutations of Tseitin formulas and the pigeonhole principle. The first lower bound was previously unknown even for $\text {OBDD}$ proofs and the second one extends the result of Tveretina et al. from $\text {OBDD}$ to $\text {OBDD}$.In 2001 Aguirre and Vardi proposed an approach to the propositional satisfiability problem based on $\text {OBDD}$ s and symbolic quantifier elimination $ algorithms). We augment these algorithms with the operation of reordering of variables and call the new scheme $\text {OBDD}$ algorithms. We notice that there exists an $\text {OBDD}$ algorithm that solves satisfiable and unsatisfiable Tseitin formulas in polynomial time, but we show that there are formulas representing systems of linear equations over $\mathbb {F}_2$ that are hard for $\text {OBDD}$ algorithms. Our hard instances are satisfiable formulas representing systems of linear equations over $\mathbb {F}_2$ that correspond to checksum matrices of error correcting codes. (shrink)

Current dynamic-epistemic logics model different types of information change in multi-agent scenarios. We generalize these logics to a probabilistic setting, obtaining a calculus for multi-agent update with three natural slots: prior probability on states, occurrence probabilities in the relevant process taking place, and observation probabilities of events. To match this update mechanism, we present a complete dynamic logic of information change with a probabilistic character. The completeness proof follows a compositional methodology that applies to a much larger class (...) of dynamic-probabilistic logics as well. Finally, we discuss how our basic update rule can be parameterized for different update policies, or learning methods. (shrink)

In this dissertation we present proof systems for several modal logics. These proof systems are based on analytic (or semantic) tableaux. -/- Modal logics are logics for reasoning about possibility, knowledge, beliefs, preferences, and other modalities. Their semantics are almost always based on Saul Kripke’s possible world semantics. In Kripke semantics, models are represented by relational structures or, equivalently, labeled graphs. Syntactic formulas that express statements about knowledge and other modalities are evaluated in terms of such models. -/- This dissertation (...) focuses on modal logics with dynamic operators for public announcements, belief revision, preference upgrades, and so on. These operators are defined in terms of mathematical operations on Kripke models. Thus, for example, a belief revision operator in the syntax would correspond to a belief revision operation on models. -/- The ‘dynamic’ semantics of dynamic modal logics are a clever way of extending languages without compromising on intuitiveness. We present ‘dynamic’ tableau proof systems for these dynamic semantics, with the express aim to make them conceptually simple, easy to use, modular, and extensible. This we do by reflecting the semantics as closely as possible in the components of our tableau system. For instance, dynamic operations on Kripke models have counterpart dynamic relations between tableaux. -/- Soundness, completeness, and decidability are three of the most important properties that a proof system may have. A proof system is sound if and only if any formula for which a proof exists, is true in every model. A proof system is complete if and only if for any formula that is true in all models, a proof exists. A proof system is decidable if and only if any formula can be proved to be a theorem or not a theorem in a finite number of steps. All proof systems in this dissertation are sound, complete, and decidable. -/- Part of our strategy to create modular tableau systems is to delay concerns over decidability until after soundness and completeness have been established. Decidability is attained through the operations of folding and through operations on ‘tableau cascades’, which are graphs of tableaux. -/- Finally, we provide a proof-of-concept implementation of our dynamic tableau system for public announcement logic in the Clojure programming language. (shrink)

A combination of epistemic logic and dynamic logic of programs is presented. Although rich enough to formalize some simple game-theoretic scenarios, its axiomatization is problematic as it leads to the paradoxical conclusion that agents are omniscient. A cut-free labelled Gentzen-style proof system is then introduced where knowledge and action, as well as their combinations, are formulated as rules of inference, rather than axioms. This provides a logical framework for reasoning about games in a modular and systematic way, and to (...) give a step-by-step reconstruction of agents omniscience. In particular, its semantic assumptions are made explicit and a possible solution can be found in weakening the properties of the knowledge operator. (shrink)

Dynamic algebras combine the classes of Boolean (B 0) and regular (R ; *) algebras into a single finitely axiomatized variety (B R ) resembling an R-module with scalar multiplication . The basic result is that * is reflexive transitive closure, contrary to the intuition that this concept should require quantifiers for its definition. Using this result we give several examples of dynamic algebras arising naturally in connection with additive functions, binary relations, state trajectories, languages, and flowcharts. The (...) main result is that free dynamic algebras are residually finite (i.e. factor as a subdirect product of finite dynamic algebras), important because finite separable dynamic algebras are isomorphic to Kripke structures. Applications include a new completeness proof for the Segerberg axiomatization of prepositional dynamic logic, and yet another notion of regular algebra. (shrink)

Current dynamic-epistemic logics model different types of information change in multi-agent scenarios. We generalize these logics to a probabilistic setting, obtaining a calculus for multi-agent update with three natural slots: prior probability on states, occurrence probabilities in the relevant process taking place, and observation probabilities of events. To match this update mechanism, we present a complete dynamic logic of information change with a probabilistic character. The completeness proof follows a compositional methodology that applies to a much larger class (...) of dynamic-probabilistic logics as well. Finally, we discuss how our basic update rule can be parameterized for different update policies, or learning methods. (shrink)

BackgroundInnovations in technology have contributed to rapid changes in the way that modern biomedical research is carried out. Researchers are increasingly required to endorse adaptive and flexible approaches to accommodate these innovations and comply with ethical, legal and regulatory requirements. This paper explores how Dynamic Consent may provide solutions to address challenges encountered when researchers invite individuals to participate in research and follow them up over time in a continuously changing environment.MethodsAn interdisciplinary workshop jointly organised by the University of (...) Oxford and the COST Action CHIP ME gathered clinicians, researchers, ethicists, lawyers, research participants and patient representatives to discuss experiences of using Dynamic Consent, and how such use may facilitate the conduct of specific research tasks. The data collected during the workshop were analysed using a content analysis approach.ResultsDynamic Consent can provide practical, sustainable and future-proof solutions to challenges related to participant recruitment, the attainment of informed consent, participant retention and consent management, and may bring economic efficiencies.ConclusionsDynamic Consent offers opportunities for ongoing communication between researchers and research participants that can positively impact research. Dynamic Consent supports inter-sector, cross-border approaches and large scale data-sharing. Whilst it is relatively easy to set up and maintain, its implementation will require that researchers re-consider their relationship with research participants and adopt new procedures. (shrink)

The dynamics of eukaryotic DNA polymerases has been difficult to establish because of the difficulty of tracking them along the chromosomes during DNA replication. Recent work has addressed this problem in the yeasts Schizosaccharomyces pombe and Saccharomyces cerevisiae through the engineering of replicative polymerases to render them prone to incorporating ribonucleotides at high rates. Their use as tracers of the passage of each polymerase has provided a picture of unprecedented resolution of the organization of replicons and replication origins in the (...) two yeasts and has uncovered important differences between them. Additional studies have found an overlapping distribution of DNA polymorphisms and the junctions of Okazaki fragments along mononucleosomal DNA. This sequence instability is caused by the premature release of polymerase δ and the retention of non proof‐read DNA tracts replicated by polymerase α. The possible implementation of these new experimental approaches in multicellular organisms opens the door to the analysis of replication dynamics under a broad range of genetic backgrounds and physiological or pathological conditions. (shrink)

The parameters governing our behavior are in constant flux. Accurately capturing these dynamics in cognitive models poses a challenge to modelers. Here, we demonstrate a mapping of ACT-R's declarative memory onto the linear ballistic accumulator (LBA), a mathematical model describing a competition between evidence accumulation processes. We show that this mapping provides a method for inferring individual ACT-R parameters without requiring the modeler to build and fit an entire ACT-R model. Existing parameter estimation methods for the LBA can be used, (...) instead of the computationally expensive parameter sweeps that are traditionally done. We conduct a parameter recovery study to confirm that the LBA can recover ACT-R parameters from simulated data. Then, as a proof of concept, we use the LBA to estimate ACT-R parameters from an empirical dataset. The resulting parameter estimates provide a cognitively meaningful explanation for observed differences in behavior over time and between individuals. In addition, we find that the mapping between ACT-R and LBA lends a more concrete interpretation to ACT-R's latency factor parameter, namely as a measure of response caution. This work contributes to a growing movement towards integrating formal modeling approaches in cognitive science. (shrink)

Chaos is often explained in terms of random behaviour; and having positive Kolmogorov–Sinai entropy (KSE) is taken to be indicative of randomness. Although seemly plausible, the association of positive KSE with random behaviour needs justification since the definition of the KSE does not make reference to any notion that is connected to randomness. A common way of justifying this use of the KSE is to draw parallels between the KSE and ShannonÕs information theoretic entropy. However, as it stands this no (...) more than a heuristic point, because no rigorous connection between the KSE and ShannonÕs entropy has been established yet. This paper fills this gap by proving that the KSE of a Hamiltonian dynamical system is equivalent to a generalized version of ShannonÕs information theoretic entropy under certain plausible assumptions. Ó 2005 Elsevier Ltd. All rights reserved. (shrink)

This paper presents eight (previously unpublished) adaptive logics for belief revision, each of which define a belief revision operation in the sense of the AGM framework. All these revision operations are shown to satisfy the six basic AGM postulates for belief revision, and Parikh's axiom of Relevance. Using one of these logics as an example, we show how their proof theory gives a more dynamic flavor to belief revision than existing approaches. It is argued that this turns belief revision (...) (that obeys Relevance) into a more natural undertaking, where analytic steps are performed only as soon as they turn out to be necessary in order to uphold certain beliefs. (shrink)

This thesis is on information dynamics modeled using *dynamic epistemic logic*. It takes the simple perspective of identifying models with maps, which under a suitable topology may be analyzed as *topological dynamical systems*. It is composed of an introduction and six papers. The introduction situates DEL in the field of formal epistemology, exemplifies its use and summarizes the main contributions of the papers.Paper I models the information dynamics of the *bystander effect* from social psychology. It shows how augmenting the (...) standard machinery of DEL with a decision making framework yields mathematically self-contained models of dynamic processes, a prerequisite for rigid model comparison.Paper II extrapolates from Paper I's construction, showing how the augmentation and its natural peers may be construed as maps. It argues that under the restriction of dynamics produced by DEL dynamical systems still falls a collection rich enough to be of interest. Paper III compares the approach of Paper II with *extensional protocols*, the main alternative augmentation to DEL. It concludes that both have benefits, depending on application. In favor of the DEL dynamical systems, it shows that extensional protocols designed to mimic simple, DEL dynamical systems require infinite representations. Paper IV focuses on *topological dynamical systems*. It argues that the *Stone topology* is a natural topology for investigating logical dynamics as, in it, *logical convergence* coinsides with topological convergence. It investigates the recurrent behavior of the maps of Papers II and III, providing novel insigths on their long-term behavior, thus providing a proof of concept for the approach.Paper V lays the background for Paper IV, starting from the construction of metrics generalizing the Hamming distance to infinite strings, inducing the Stone topology. It shows that the Stone topology is unique in making logical and topological convergens coinside, making it the natural topology for logical dynamics. It further includes a metric-based proof that the hitherto analyzed maps are continuous with respect to the Stone topology. Paper VI presents two characterization theorems for the existence of *reduction laws*, a common tool in obtaining complete dynamic logics. In the compact case, continuity in the Stone topology characterizes existence, while a strengthening is required in the non-compact case. The results allow the recasting of many logical dynamics of contemporary interest as topological dynamical systems. (shrink)

This introductory chapter sets the stage for an engaging exploration of the multifaceted concept of proof in the philosophy of mathematical practice. As a fundamental pillar of mathematics, proof has long been a subject of intense scrutiny for mathematicians and philosophers alike. Traditionally, proofs have been perceived as rigorous and deductive arguments, and this analysis was directed towards the notion of formal proof. However, recent developments have challenged this traditional view, highlighting the dynamic and evolving nature of mathematical (...) proofs. In this section, we bring together diverse perspectives from leading scholars to delve into the philosophical significance and complexity of mathematical proof. (shrink)

Complex frameworks for defining programming languages aim to generate various tools (e.g. interpreters, symbolic execution engines, deductive verifiers, etc.) using only the formal definition of a language. When used at an industrial scale, these tools are constantly updated, and at the same time, it is required to be trustworthy. Ensuring the correctness of such a framework is practically impossible. A solution is to generate proof objects as correctness artefacts that can be checked by an external trusted checker. A logic suitable (...) for developing such frameworks is matching logic. K framework is a canonical example having matching logic-based foundation. Since the (symbolic) configurations of the programs are represented by matching logic patterns, the algorithms computing the dynamics of these configurations can be seen as pattern transformers and a proof object should be generated for the relationship between these patterns. In this paper, we show that conjunctions and disjunctions of patterns, produced by semantics or analysis rules, can be safely normalized using unification and antiunification algorithms. We also provide a prototype implementation of our proof object generation technique and a checker for certifying the generated objects. (shrink)

This article analyzes the temporal single-system interpretation (TSSI) of Marx’s economics. From a methodological viewpoint, the TSSI lacks both a clear definition of equilibrium and a rigorous analysis of disequilibrium dynamics, and the dynamic framework is incomplete. From a substantive viewpoint, temporal single-system (TSS) claims are trivially obtained by assuming that goods exchange at values, apart possibly from out-of-steady-state random deviations. Finally, the proof of the law of the tendential fall in the profit rate is tautologically true, but its (...) theoretical relevance is unclear. (shrink)

We present a dynamic approach to Peirce’s original construal of abductive logic as a logic of conjecture making, and provide a new decidable, contraction-free and cut-free proof system for the dynamic logic of abductive inferences with neighborhood semantics. Our formulation of the dynamic logic of abduction follows the philosophical and scientific track that led Peirce to his late, post-1903 characterization of abductive conclusions as investigands, namely invitations to investigate propositions conjectured at the level of pre-beliefs.

The goal of the present paper is to construct a formal explication of the pluralistic ignorance explanation of the bystander effect. The social dynamics leading to inaction is presented, decomposed, and modeled using dynamic epistemic logic augmented with ‘transition rules’ able to characterize agent behavior. Three agent types are defined: First Responders who intervene given belief of accident; City Dwellers, capturing ‘apathetic urban residents’ and Hesitators, who observe others when in doubt, basing subsequent decision on social proof. It is (...) shown how groups of the latter may end in a state of pluralistic ignorance leading to inaction. Sequential models for each agent type are specified, and their results compared to empirical studies. It is concluded that only the Hesitator model produces reasonable results. (shrink)

The criminal defendant is presumed innocent and his guilt must be proved beyond reasonable doubt for conviction. On some issues, however, the defendant must prove his innocence on the balance of probabilities to avoid conviction. Commentators have despaired of reconciling reverse burdens with the presumption in a principled way. Andrew Stumer has made a fresh attempt; however, his solution is overly rigid and rule bound. The presumption is engaged in a dynamic enterprise—minimizing the expected cost of error, mistaken acquittals (...) as well as wrongful convictions. Stumer’s fixed criminal standard and stringent restrictions on reverse burdens work against this goal. A more flexible approach is required, reflecting the calculus of error management. Where the cost or probability of wrongful conviction is relatively low, and the cost or probability of mistaken acquittal relatively high, it may be necessary to lower the standard of proof, or even to reverse the burden of proof. To inhibit these strategies is to increase the expected cost of error at trial. (shrink)

This paper combines propositional dynamic logic ) with propositional inquisitive logic ). The result of this combination is a logical system \ that conservatively extends both \ and \, and, moreover, allows for an interaction of the question-forming operator from \ with the structured modalities from \. We study this system from a semantic as well as a syntactic point of view. These two perspectives are linked via a completeness proof, which also shows that \ is decidable.

Having analyzed the formal aspects of Wallace’s proof of the Born rule, we now discuss the concepts and axioms upon which it is built. Justification for most axioms is shown to be problematic, and at times contradictory. Some of the problems are caused by ambiguities in the concepts used. We conclude the axioms are not reasonable enough to be taken as mandates of rationality in Everettian Quantum Mechanics. This invalidates the interpretation of Wallace’s result as meaning it would be rational (...) for Everettian agents to decide using the Born rule. (shrink)

Dynamic topological logic is a multi-modal logic that was introduced for reasoning about dynamic topological systems, i.e. structures of the form $\langle{\mathfrak{X}, f}\rangle $, where $\mathfrak{X}$ is a topological space and $f$ is a continuous function on it. The problem of finding a complete and natural axiomatization for this logic in the original tri-modal language has been open for more than one decade. In this paper, we give a natural axiomatization of $\textsf{DTL}$ and prove its strong completeness with (...) respect to the class of all dynamic topological systems. Our proof system is infinitary in the sense that it contains an infinitary derivation rule with countably many premises and one conclusion. It should be remarked that $\textsf{DTL}$ is semantically non-compact, so no finitary proof system for this logic could be strongly complete. Moreover, we provide an infinitary axiomatic system for the logic ${\textsf{DTL}}_{\mathcal{A}}$, i.e. the $\textsf{DTL}$ of Alexandrov spaces, and show that it is strongly complete with respect to the class of all dynamical systems based on Alexandrov spaces. (shrink)

In the middle of the 1980s, logical tools were discovered that make it possible to model changes in belief and knowledge in entirely new ways. These logical tools turned out to be applicable both to human beliefs and to the contents of databases. This is the first textbook in this new area. It contains both discursive chapters with a minimum of formalism and formal chapters in which proofs and proof methods are presented. By using different selections from the formal (...) section the book can be used on all levels of University education. (shrink)

A part of relativistic dynamics is axiomatized by simple and purely geometrical axioms formulated within first-order logic. A geometrical proof of the formula connecting relativistic and rest masses of bodies is presented, leading up to a geometric explanation of Einstein's famous E = mc² . The connection of our geometrical axioms and the usual axioms on the conservation of mass, momentum and four-momentum is also investigated.

According to Kant, justifying the application of mathematics to objects in natural science requires metaphysically constructing the concept of matter. Kant develops these constructions in the Metaphysical Foundations of Natural Science (MAdN). Kant’s specific aim is to develop a dynamic theory of matter to replace corpuscular theory. In his Preface Kant claims completely to exhaust the metaphysical doctrine of body, but in the General Remark to MAdN ch. 2, “Dynamics,” Kant admits that once matter is reconceived as basic forces, (...) it is no longer possible to construct the concept of matter. I argue that Kant’s admission is only the tip of the problem, and that none of Kant’s commentators has fully grasped the problems infecting the MAdN that underlie Kant’s admission. I show that Kant’s proof that matter consists of forces is fallacious. I then re-analyze the circularity in Kant’s definition of density, criticizing both Adickes’ formulations and his later dissolution of it. I also show that a third circularity infects the relations between Kant’s treatment of “Dynamics” and “Mechanics” (MAdN ch. 3). These three fundamental problems demonstrate the untenability of Kant’s metaphysical method, and they require the radical revision of the relation between mathematics and metaphysics Kant undertakes in his opus postumum. I show that some of Kant’s most surprising and critical later claims about the Critical philosophy are correct, and that they require the sorts of remedies Kant contemplates in the opus postumum. (I defend the essentially correct analyses offered by Burkhard Tuschling and Eckart Forster against criticisms by Michael Friedman.). (shrink)

Throughout the last decade, there has been an increased interest in various forms of dynamic epistemic logics to model the flow of information and the effect this flow has on knowledge in multi-agent systems. This enterprise, however, has mostly been applicationally and semantically driven. This results in a limited amount of proof theory for dynamic epistemic logics. In this paper, we try to compensate for a part of this by presenting terminating tableau systems for full dynamic epistemic (...) logic with action models and for a hybrid public announcement logic. The tableau systems are extensions of already existing tableau systems, in addition to which we have used the reduction axioms of dynamic epistemic logic to define rules for the dynamic part of the logics. Termination is shown using methods introduced by Braüner, Bolander, and Blackburn. (shrink)

In the present article, we introduce a multi-type display calculus for dynamic epistemic logic, which we refer to as Dynamic Calculus. The display approach is suitable to modularly chart the space of dynamic epistemic logics on weaker-than-classical propositional base. The presence of types endows the language of the Dynamic Calculus with additional expressivity, allows for a smooth proof-theoretic treatment, and paves the way towards a general methodology for the design of proof systems for the generality of (...) dynamic logics, and certainly beyond dynamic epistemic logic. We prove that the Dynamic Calculus adequately captures Baltag–Moss–Solecki's dynamic epistemic logic, and enjoys Belnap-style cut elimination. (shrink)

Modern insolubility proofs of the measurement problem in quantum mechanics not only differ in their complexity and degree of generality, but also reveal a lack of agreement concerning the fundamental question of what constitutes such a proof. A systematic reworking of the (incomplete) 1970 Fine theorem is presented, which is intended to go some way toward clarifying the issue.

Here I describe a game that I use in my logic classes once we begin derivations. The game can help improve class dynamics, help struggling students recognizes they are not alone, open lines of communication between students, and help students of all levels prepare for exams. The game can provide struggling students with more practice with the fundamental rules of a logical system while also challenging students who excel at derivations. If students are struggling with particular rules or strategies in (...) the system, the game can be tailored to address them. I explain how the game has evolved since I started using it, highlighting the pedagogical benefits of the changes I have made, and I provide examples of the handouts I distribute and a “checklist” to use before, during, and after the game. (shrink)

This article describes new aspects of hysteresis dynamics which have been uncovered through computer experiments. There are several motivations to be interested in fast-slow dynamics. For instance, many physiological or biological systems display different time scales. The bursting oscillations which can be observed in neurons, β-cells of the pancreas and population dynamics are essentially studied via bifurcation theory and analysis of fast-slow systems (Keener and Sneyd, 1998; Rinzel, 1987). Hysteresis is a possible mechanism to generate bursting oscillations. A first part (...) of this article presents the computer techniques (the dotted-phase portrait, the bifurcation of the fast dynamics and the wave form) we have used to represent several patterns specific to hysteresis dynamics. This framework yields a natural generalization to the notion of bursting oscillations where, for instance, the active phase is chaotic and alternates with a quiescent phase. In a second part of the article, we emphasize the evolution to chaos which is often associated with bursting oscillations on the specific example of the Hindmarsh–Rose system. This evolution to chaos has already been studied with classical tools of dynamical systems but we give here numerical evidence on hysteresis dynamics and on some aspects of the wave form. The analytical proofs will be given elsewhere. (shrink)

This article investigates to what extent protocols for dynamicdisputes, i.e., disputes in which the information base can vary at differentstages, can be justified in terms of logics for defeasible argumentation. Firsta general framework is formulated for dialectical proof theories for suchlogics. Then this framework is adapted to serve as a framework for protocols fordynamic disputes, after which soundness and fairness properties are formulated for such protocols relative to dialectical proof theories. It then turns out that certaintypes of protocols that are (...) perfectly fine with a static information base, arenot sound or fair in a dynamic setting. Finally, a natural dynamic protocolis defined for which soundness and fairness can be established. (shrink)

The paper introduces a new kind of models for the logic of proofs LP, the group justification models. While being an elaboration of Fitting models, the group justification models are a special case of the models of general awareness. Soundness and completeness results of LP with respect to the new semantics are established. The paper also offers an interpretation of the group models, which pertains to awareness and group epistemic dynamics.