We prove that every abstractly defined game algebra can be represented as an algebra of consistent pairs of monotone outcome relations over a game board. As a corollary we obtain Goranko's result that van Benthem's conjectured axiomatization for equivalent game terms is indeed complete.

We prove that every abstractly defined game algebra can be represented as an algebra of consistent pairs of monotone outcome relations over a game board. As a corollary we obtain Goranko's result that van Benthem's conjectured axiomatization for equivalent game terms is indeed complete.

The papers collected in this volume exemplify some of the trends in current approaches to logic, language and computation. Written by authors with varied academic backgrounds, the contributions are intended for an interdisciplinary audience. The first part of this volume addresses issues relevant for multi-agent systems: reasoning with incomplete information, reasoning about knowledge and beliefs, and reasoning about games. Proofs as formal objects form the subject of Part II. Topics covered include: contributions on logical frameworks, linear logic, and different approaches (...) to formalized reasoning. Part III focuses on representations and formal methods in linguistic theory, addressing the areas of comparative and temporal expressions, modal subordination, and compositionality. (shrink)

We present a new notion of game equivalence that captures basic powers of interacting players. We provide a representation theorem, a complete logic, and a new game algebra for basic powers. In doing so, we establish connections with imperfect information games and epistemic logic. We also identify some new open problems concerning logic and games.

Through a phenomenological study of horse-human relations, this article explores the ways in which, as embodied beings, we live relationally, rather than as separate human identities. Conceptually this challenges oppositional logic and humanist assumptions, but where poststructuralist treatments of these issues tend to remain abstract, this article is concerned with an embodied demonstration of the ways in which we experience a relational or in-between logic in our everyday lives.

We present a new notion of game equivalence that captures basic powers of interacting players. We provide a representation theorem, a complete logic, and a new game algebra for basic powers. In doing so, we establish connections with imperfect information games and epistemic logic. We also identify some new open problems concerning logic and games.

We describe a fully abstract semantics for a simple functional language with locally declared names which may be used as pointers to names. It is based on a category of dialogue games acted upon by the group of natural number automorphisms. This allows a formal, semantic characterization of the key properties of names such as freshness and locality.We describe a model of the call-by-value λ-calculus based on these games, and show that it can be used to interpret the nu-calculus of (...) Pitts and Stark. We then construct a model of our pointer-language by extending our category of games with an explicit representation of the store, using a notion of semantic garbage-collection to erase inaccessible pointers. Using factorization and decomposition techniques, we show that the compact elements of our model are definable as terms, and hence it is fully abstract. (shrink)

Qualitative coalitional games (QCGs) were introduced as abstract formal models of goal-oriented cooperative systems. A QCG is a game in which each agent is assumed to have some goal to achieve, and in which agents must typically cooperate with others in order to satisfy their goals. In this paper, we show how it is possible to reason about QCGs using Coalition Logic (CL), a formalism intended to facilitate reasoning about coalitional powers in game-like multiagent systems. We introduce a (...) correspondence relation between QCGs and interpretations for CL, which defines the circumstances under which a CL interpretation correctly characterises a QCG. The complexity of deciding correspondence between QCGs and interpretations for CL is shown to vary from being tractable up to Πp 2-complete, depending on the representation chosen for the QCG and interpretation. We then show how various properties and solution concepts of QCGs can be characterised as CL formula schemes. The ideas are illustrated via a detailed worked example, in which we demonstrate how a model checker can be deployed to investigate whether a particular system has the properties in question. (shrink)

Game logics describe general games through powers of players for forcing outcomes. In particular, they encode an algebra of sequential game operations such as choice, dual and composition. Logic games are special games for specific purposes such as proof or semantical evaluation for first-order or modal languages. We show that the general algebra of game operations coincides with that over just logical evaluation games, whence the latter are quite general after all. The main tool in proving (...) this is a representation of arbitrary games as modal or first-order evaluation games. We probe how far our analysis extends to product operations on games. We also discuss some more general consequences of this new perspective for standard logic. (shrink)

Abstract In this article we develop a relational understanding of sociality, that is, an account of social life that takes relation as primary. This stands in contrast to the common assumption that relations arise when subjects interact, an account that gives logical priority to separation. We will develop this relational understanding through a reading of the work of Martin Buber, a social philosopher primarily interested in dialogue, meeting, relationship, and the irreducibility and incomparability of reality. In particular, the article contrasts (...) Buber’s work with that of poststructuralist theorists who take as their starting point the deconstruction of the Hegelian logic of binary oppositions. Deconstruction understands difference as the excess that undoes the binary, but Buber, we argue, shows how difference derives from the primacy and ontological undefinability of relation. Relational logic does not exclude the logic of separations and oppositions: relation is the primal ground that makes separations possible. Content Type Journal Article Pages 1-13 DOI 10.1007/s11841-011-0278-9 Authors Andrew Metcalfe, School of Social Sciences and International Studies, University of New South Wales, Sydney, NSW 2052, Australia Ann Game, School of Social Sciences and International Studies, University of New South Wales, Sydney, NSW 2052, Australia Journal Sophia Online ISSN 1873-930X Print ISSN 0038-1527. (shrink)

We discuss games of both perfect and imperfect information at two levels of structural detail: players’ local actions, and their global powers for determining outcomes of the game. We propose matching logical languages for both. In particular, at the ‘action level’, imperfect information games naturally model a combined ‘dynamic-epistemic language’ – and we find correspondences between special axioms and particular modes of playing games with their information dynamics. At the ‘outcome level’, we present suitable notions of game equivalence, (...) plus some simple representation results. (shrink)

In philosophical logic and metaphysics there is a long-standing debate around the most appropriate structures to represent indeterministic scenarios concerning the future. We reconstruct here such a debate in a computational setting, focusing on the fundamental difference between moment-based and history-based structures. Our presentation is centered around two versions of an indeterministic scenario in which a programmer wants a machine to perform a given task at some point after a specified time. One of the two versions includes an assumption about (...) the future behaviour of the machine that cannot be encoded in any programming instruction; such version has models over history-based structures but no model over a moment-based structure. Therefore, our work adds a new stance to the debate: moment-based structures can be said to rule out certain indeterministic scenarios that are computationally unfeasible. (shrink)

Mental representations remain the central posits of psychology after many decades of scrutiny. However, there is no consensus about the representational format(s) of biological cognition. This paper provides a survey of evidence from computational cognitive psychology, perceptual psychology, developmental psychology, comparative psychology, and social psychology, and concludes that one type of format that routinely crops up is the language-of-thought (LoT). We outline six core properties of LoTs: (i) discrete constituents; (ii) role-filler independence; (iii) predicate–argument structure; (iv) logical operators; (v) (...) inferential promiscuity; and (vi) abstract content. These properties cluster together throughout cognitive science. Bayesian computational modeling, compositional features of object perception, complex infant and animal reasoning, and automatic, intuitive cognition in adults all implicate LoT-like structures. Instead of regarding LoT as a relic of the previous century, researchers in cognitive science and philosophy-of-mind must take seriously the explanatory breadth of LoT-based architectures. We grant that the mind may harbor many formats and architectures, including iconic and associative structures as well as deep-neural-network-like architectures. However, as computational/representational approaches to the mind continue to advance, classical compositional symbolic structures – that is, LoTs – only prove more flexible and well-supported over time. (shrink)

We consider the problem of finding and classifying representations in algebraic logic. This is approached by letting two players build a representation using a game. Homogeneous and universal representations are characterized according to the outcome of certain games. The Lyndon conditions defining representable relation algebras (for the finite case) and a similar schema for cylindric algebras are derived. Finite relation algebras with homogeneous representations are characterized by first order formulas. Equivalence games are defined, and are used (...) to establish whether an algebra is ω-categorical. We have a simple proof that the perfect extension of a representable relation algebra is completely representable. An important open problem from algebraic logic is addressed by devising another two-player game, and using it to derive equational axiomatisations for the classes of all representable relation algebras and representable cylindric algebras. Other instances of this approach are looked at, and include the step by step method. (shrink)

We develop a variant of Least Fixed Point logic based on First Orderlogic with a relaxed version of guarded quantification. We develop aGame Theoretic Semantics of this logic, and find that under reasonableconditions, guarding quantification does not reduce the expressibilityof Least Fixed Point logic. But we also find that the guarded version ofa least fixed point algorithm may have a greater time complexity thanthe unguarded version, by a linear factor.

This paper does not deal with the applications of game theory for which this theory was first developed, that is, for modelling economic systems and rational decision making. But I do not want to consider games as abstract mathematical structures, either. I want to concentrate on what it is that makes a game actually playable. This playability means both the possibility of finding and formulating the strategy that a player uses and the feasibility of actually applying the strategy (...) in question in making one’s moves. (shrink)

Each of our theories of mental representation provides some insight into how the mind works. However, these insights often seem incompatible, as the debates between symbolic, dynamical, emergentist, sub-symbolic, and grounded approaches to cognition attest. Mental representations—whatever they are—must share many features with each of our theories of representation, and yet there are few hypotheses about how a synthesis could be possible. Here, I develop a theory of the underpinnings of symbolic cognition that shows how sub-symbolic dynamics may give (...) rise to higher-level cognitive representations of structures, systems of knowledge, and algorithmic processes. This theory implements a version of conceptual role semantics by positing an internal universal representation language in which learners may create mental models to capture dynamics they observe in the world. The theory formalizes one account of how truly novel conceptual content may arise, allowing us to explain how even elementary logical and computational operations may be learned from a more primitive basis. I provide an implementation that learns to represent a variety of structures, including logic, number, kinship trees, regular languages, context-free languages, domains of theories like magnetism, dominance hierarchies, list structures, quantification, and computational primitives like repetition, reversal, and recursion. This account is based on simple discrete dynamical processes that could be implemented in a variety of different physical or biological systems. In particular, I describe how the required dynamics can be directly implemented in a connectionist framework. The resulting theory provides an “assembly language” for cognition, where high-level theories of symbolic computation can be implemented in simple dynamics that themselves could be encoded in biologically plausible systems. (shrink)

I. Levi has advocated a decision-theoretic account of belief revision. We argue that the game-theoretic framework of Interrogative Inquiry Games, proposed by J. Hintikka, can extend and clarify this account. We show that some strategic use of the game rules generate Expansions, Contractions and Revisions, and we give representation results. We then extend the framework to represent explicitly sources of answers, and apply it to discuss the Recovery Postulate. We conclude with some remarks about the potential extensions of (...) interrogative games, with respect to some issues in the theory of belief change. (shrink)

This paper has a twofold scope. The first one is to clarify and put in evidence the isomorphic character of two theories developed in quite different fields: on one side, threshold logic, on the other side, simple games. One of the main purposes in both theories is to determine when a simple game is representable as a weighted game, which allows a very compact and easily comprehensible representation. Deep results were found in threshold logic in the sixties and (...) seventies for this problem. However, game theory has taken the lead and some new results have been obtained for the problem in the past two decades. The second and main goal of this paper is to provide some new results on this problem and propose several open questions and conjectures for future research. The results we obtain depend on two significant parameters of the game: the number of types of equivalent players and the number of types of shift-minimal winning coalitions. (shrink)

Although the notion of common or mutual belief plays a crucial role in game theory, economics and social philosophy, no thoroughly representational account of it has yet been developed. In this paper, I propose two desiderata for such an account, namely, that it take into account the possibility of inconsistent data without portraying the human mind as logically and mathematically omniscient. I then propose a definition of mutual belief which meets these criteria. This account takes seriously the existence of (...) computational limitations. Finally, I point out that the epistemic logic (or theory) needed to make the definition work is subject to the Kaplan/Montague Paradox of the Knower. I argue that this is not a defect of the account, and I discuss briefly the bearing of recent work on the paradox of the Liar upon this problem. (shrink)

We consider the problem of finding and classifying representations in algebraic logic. This is approached by letting two players build a representation using a game. Homogeneous and universal representations are characterized according to the outcome of certain games. The Lyndon conditions defining representable relation algebras and a similar schema for cylindric algebras are derived. Finite relation algebras with homogeneous representations are characterized by first order formulas. Equivalence games are defined, and are used to establish whether an (...) algebra is $\omega$-categorical. We have a simple proof that the perfect extension of a representable relation algebra is completely representable. An important open problem from algebraic logic is addressed by devising another two-player game, and using it to derive equational axiomatisations for the classes of all representable relation algebras and representable cylindric algebras. Other instances of this approach are looked at, and include the step by step method. (shrink)

The last 14 chapters of book 1 of Aristotle's "Prior Analytics" are concerned with the representation in the formal language of syllogistic of propositions and arguments expressed in more or less everyday Greek. In his commentary on those chapters, Alexander of Aphrodisias explains some of Aristotle's more opaque assertions and discusses post-Aristotelian ideas in semantics and the philosophy of language. In doing so he provides an unusual insight into the way in which these disciplines developed in the Hellenistic era. He (...) also shows a more sophisticated understanding of these fields than Aristotle himself, while remaining a staunch defender of Aristotle's emphasis on meaning as opposed to Stoics concern with verbal formulation. In his commentary on the final chapter of book 1 Alexander offers a thorough discussion of Aristotle's distinction between denying that something is, e.g., white and asserting that it is non-white. (shrink)

Using a variation of the rainbow construction and various pebble and colouring games, we prove that RRA, the class of all representable relation algebras, cannot be axiomatised by any first-order relation algebra theory of bounded quantifier depth. We also prove that the class At(RRA) of atom structures of representable, atomic relation algebras cannot be defined by any set of sentences in the language of RA atom structures that uses only a finite number of variables.

We analyze the representation of binary relations in general, and in particular of functions and of total antisymmetric relations, in monadic third order logic, that is, the simple typed theory of sets with three types. We show that there is no general representation of functions or of total antisymmetric relations in this theory. We present partial representations of functions and of total antisymmetric relations which work for large classes of these relations, and show that there is an adequate representation (...) of cardinality in this theory. The relation of our work to similar work by Henrard and Allen Hazen is discussed. This work can be understood as part of a program of assessing the capabilities of weak logical frameworks: our results are applicable for example, to the framework in David Lewis’s Parts of Classes. (shrink)

In the context of propositional logics, we apply semantics modulo satisfiability—a restricted semantics which comprehends only valuations that satisfy some specific set of formulas—with the aim to efficiently solve some computational tasks. Three possible such applications are developed.We begin by studying the possibility of implicitly representing rational McNaughton functions in Łukasiewicz Infinitely-valued Logic through semantics modulo satisfiability. We theoretically investigate some approaches to such representation concept, called representation modulo satisfiability, and describe a polynomial algorithm that builds representations in (...) the newly introduced system. An implementation of the algorithm, test results and ways to randomly generate rational McNaughton functions for testing are presented. Moreover, we propose an application of such representations to the formal verification of properties of neural networks by means of the reasoning framework of Łukasiewicz Infinitely-valued Logic.Then, we move to the investigation of the satisfiability of joint probabilistic assignments to formulas of Łukasiewicz Infinitely-valued Logic, which is known to be an NP-complete problem. We provide an exact decision algorithm derived from the combination of linear algebraic methods with semantics modulo satisfiability. Also, we provide an implementation for such algorithm for which the phenomenon of phase transition is empirically detected.Lastly, we study the game theory situation of observable games, which are games that are known to reach a Nash equilibrium, however, an external observer does not know what is the exact profile of actions that occur in a specific instance; thus, such observer assigns subjective probabilities to players actions. We study the decision problem of determining if a set of these probabilistic constraints is coherent by reducing it to the problems of satisfiability of probabilistic assignments to logical formulas both in Classical Propositional Logic and Łukasiewicz Infinitely-valued Logic depending on whether only pure equilibria or also mixed equilibria are allowed. Such reductions rely upon the properties of semantics modulo satisfiability. We provide complexity and algorithmic discussion for the coherence problem and, also, for the problem of computing maximal and minimal probabilistic constraints on actions that preserves coherence.prepared by Sandro Márcio da Silva Preto.E-mail: [email protected]:https://doi.org/10.11606/T.45.2021.tde-17062021-163257. (shrink)

We present a logic-based formalism for modeling ofdialogues between intelligent and autonomous software agents,building on a theory of abstract dialogue games which we present.The formalism enables representation of complex dialogues assequences of moves in a combination of dialogue games, and allowsdialogues to be embedded inside one another. The formalism iscomputational and its modular nature enables different types ofdialogues to be represented.

Constructs developed for the semantics of artificial languages are often proposed as the proper description of aspects of the semantics of natural languages. Most of us are familiar with the claims that conjunction, disjunction, negation, and material implication in standard versions of propositional calculus describe the meaning of “and”, “or”, “not”, and “if …, then …” in English. The argument for such claims is not only that these constructs account for meanings in English but that they offer the advantage of (...) well-understood formal apparatus for the explication of meaning in natural language. The argument against such claims is that explications based on this apparatus leave important aspects of the meaning of “and”, “or”, “not”, and “if …, then …” unexplicated. It is charged that the advantage of a well-understood formalism is secured at the expense of truth. Many of the most significant issues in philosophic logic are or depend on questions about whether constructs from artificial languages provide adequate semantic descriptions for natural languages. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:Wittgenstein’s Reflection in Lewis Carroll’s Looking-GlassLeila S. MayAccording to one tradition in the theory of fiction, there is a kind of fantasy whose function is to invite the reader to "acknowledge the possibility of a different reality."1 In this essay I want to ask whether Lewis Carroll's Alice books fit into this category; that is, I want to explore the possibility that Alice's Adventures in Wonderland and Through the (...) Looking-Glass are not the pure nonsense that many readers take them to be. In considering the Alice books as fantasy offering a view of a "different reality" I do not deny that there are in these stories some mimetic elements alongside the fantastic—representations of things going on somewhere, somehow, in Victorian society—in which case the "different reality" presented will not be so terribly different as to be unrecognizable. For example, the Mad Tea Party in Alice's Adventures in Wonderland is not only an act of fantasy but also an act of mimesis. It certainly imitates the real tea parties often held throughout Victorian England—if caricature is a form of imitation—but it may also mime those mock tea parties held in English asylums whose goal was to model sane-like behavior to the inmates.2 An analogous question can be asked about Carroll's books in general: In addition to the component of fantasy, are they mimetic of Victorian culture itself, or merely of the Victorian conception of madness? Michel Foucault has argued that, while the very idea of la folie is an historical construct, the dialectical relationship between reason and unreason, with each pole parasitic on the other, is a structural constant. Carroll's Alice books produce images that are discharged in the confused nineteenth-century landscape where these two opposites meet. In that respect, his books are not so different from many of the more standard novels written in mid-century England. In this essay I [End Page 79] will explore features of this landscape, using a theoretical framework that has been synthesized from a number of related claims in the work of the linguistic philosopher Ludwig Wittgenstein. In addition to my long-range aim of urging further study of Wittgenstein's work by literary critics, one of my specific goals is to show that the application of Wittgensteinian methods to the works of Lewis Carroll reveals something about the hidden logic of Carroll's stories, and conversely that this procedure tests some of Wittgenstein's intuitions concerning language. Yet another goal is to suggest that the structure of the discourse of domesticity as reflected in many mid-nineteenth-century novels is curiously similar to the structure of discourse in Wonderland and Looking-Glass Land—that the language-games played at these sites are at the same time functional and dysfunctional in much the same way. That may seem like a lot to attempt in a few pages,... but to paraphrase Humpty-Dumpty, when I ask words to do that much extra work, I pay them overtime.In 1965 the philosopher George Pitcher published an essay, "Wittgenstein, Nonsense, and Lewis Carroll," in which he sought to demonstrate "the remarkable extent and depth of affinity between these two great writers with respect to nonsense." In addition, he showed that "the very same confusions with which Wittgenstein charged philosophers were deliberately employed by Carroll for comic effect," and that many of the examples that Wittgenstein used to illustrate his points "resemble, in varying degrees, examples that are found in the works of Carroll."3 While I agree with Pitcher's observation that the examples of nonsense that Wittgenstein offers are very similar to a primary strain of nonsense that runs through the Alice books, in the first section I intend to go beyond that observation and to apply some of Wittgenstein's tools to Carroll's work and show that Wittgenstein's work can be used to reveal features of literary narrative that might otherwise be obscured, and in the second section, to apply these tools to the works of fiction this side of the Looking-Glass.IWittgenstein says that a language is a "language-game." He... (shrink)

Post algebras of order + as a semantic foundation for +-valued predicate calculi were examined in [5]. In this paper Post spaces of order + being a modification of Post spaces of order n2 (cf. Traczyk [8], Dwinger [1], Rasiowa [6]) are introduced and Post fields of order + are defined. A representation theorem for Post algebras of order + as Post fields of sets is proved. Moreover necessary and sufficient conditions for the existence of representations preserving a given (...) set of infinite joins and infinite meets are established and applied to Lindenbaum-Tarski algebras of elementary theories based on +-valued predicate calculi in order to obtain a topological characterization of open theories. (shrink)

Epistemic agents may have different powers of observation and reasoning, and we show how this diversity fits into dynamic update logics.RésuméLes agents épistémiques peuvent avoir différents pouvoirs d’observation et de raisonnement, et nous montrons comment cette diversité prend place en logique dynamique de mise à jour.

In lieu of an abstract, here is a brief excerpt of the content:The Theologian's Doubts:Natural Philosophy and the Skeptical Games of GhazālīLeor HaleviIn the history of skeptical thought, which normally leaps from the Pyrrhonists to the rediscovery of Sextus Empiricus in the sixteenth century, Abū Ḥāmid Muḥammad al-Ghazālī (1058-1111) figures as a medieval curiosity. Skeptical enough to merit passing acknowledgment, he has proven too baffling to be treated fully alongside pagan, atheist, or materialist philosophers. As a theologian defending certain Muslim (...) dogmas, Ghazālī has not met what historians consider the mark of the true skeptic, a mind doubting the possibility of all systems of knowledge. But what is fascinating about him is that he brought into practical operation the tools of what I call "functional skepticism."1He denied the claims to truth of Aristotelian physics—whose basis he showed to rest on groundless belief—then turned and argued for the possibility of the Resurrection tooth and nail. The scholarly debate on The Incoherence of the Philosophers (Tahāfut al-falāsifa) has concentrated on the extent to which Ghazālī qua Ashcarite theologian was seduced into Aristotelian philosophy despite himself.2 In my view this debate has been misguided in the attempt to distill the [End Page 19] essence of Ghazālī from the book's eclectic theology; I will argue for a different view of Ghazālī on the basis of a close reading of key passages. In the unusual sections where Ghazālī applies Aristotelian language to a world not following the ordinary laws of physics, some have found Ghazālī slipping, unconsciously perhaps, into an Aristotelian frame of mind. I will show that, as a skeptical theologian with a dialogic imagination, he was rather deconstructing Aristotelian discourse while playing a Wittgensteinian sort of language game.Natural Philosopher or Speculative Theologian?The disagreement about the extent to which philosophy infected Ghazālī is ancient. Ghazālī might have studied philosophy only in order to refute it. He himself defended his philosophizing with the claim that one cannot deconstruct a system of thought until one has understood it so deeply as to elaborate upon its fundamental principles.3 His Maqāṣid al-falāsifa was in fact received, especially in trans-Pyrenean Europe, as a philosopher's genuine summary of the object of philosophy.4 The book strikes me as suspiciously creative in its representation of philosophical discourse, but it appears in any case as an expert and surprisingly unbiased treatment.5 Arabic readers knew that Ghazālī had also written a polemical treatise against philosophy, Tahāfut al-falāsifa, but they still wondered about his engagement with the ideas he challenged. Abū Bakr Ibn al-cArabī, for example, commented that Ghazālī had been unable to extricate himself from philosophy.6 Other philosophers pondered whether or not he had been a closeted member of their charmed circle and sought in his writings traces of esoteric philosophy.7Averroës's own sober sense of distance between philosophy and theology was partially a reaction to what he perceived as Ghazālī's dangerous and carefree mixture of the two sciences.8 He attacked Ghazālī's book in The Incoherence [End Page 20] of the Incoherence to restore philosophy's sense of purity, an aim he sought to accomplish by separating religious concerns from the philosopher's field of inquiry.9 Ironically, such a separation is precisely what Ghazālī might have wished to provoke by crisscrossing and blurring the line between religion and philosophy.The modern debate on chapter 17 of Tahāfut al-falāsifa has concentrated on defining Ghazālī as either a natural philosopher or an occasionalist theologian. In his defense of the possibility of miracles Ghazālī presented two theories of causation, one denying the logical basis of Aristotelian notions of natural causality, and the other more or less adopting these notions. Jointly, the two theories have seemed incompatible, and for this reason scholars have attempted to sort Ghazālī out of the apparent confusion. In 1978 L. E. Goodman argued persuasively that Ghazālī exploited rather than denied the philosophers' ideas of causality. In two articles Michael Marmura challenged Goodman, contending... (shrink)

This anthology is a thorough introduction to classic literature for those who have not yet experienced these literary masterworks. For those who have known and loved these works in the past, this is an invitation to reunite with old friends in a fresh new format. From Shakespeare's finesse to Oscar Wilde's wit, this unique collection brings together works as diverse and influential as The Pilgrim's Progress and Othello. As an anthology that invites readers to immerse themselves in the masterpieces of (...) the literary giants, it is must-have addition to any library. (shrink)

We will be dealing with “sequential circuits” in the sense of E. F. Moore and G. H. Mealy. Each such circuit is assumed to have a finite number of input wires and a finite number of output wires. Each element of such a circuit will be assumed to be an and-circuit, an or-circuit, a not-circuit, or a delay circuit, for some specified temporal delay. Each element has one output wire which, however, may branch in order to serve several purposes simultaneously. (...) The and-circuits and or-circuits have two input wires each, while the not-circuits and the delay circuits have one input wire each. (shrink)

Les agents épistémiques peuvent avoir différents pouvoirs d’observation et de raisonnement, et nous montrons comment cette diversité prend place en logique dynamique de mise à jour.

This paper proposes a logical framework for representing static and dynamic properties of different kinds of individual and collective attitudes. A complete axiomatization as well as a decidability result for the logic are given. The logic is applied to game theory by providing a formal analysis of the epistemic conditions of iterated deletion of weakly dominated strategies (IDWDS), or iterated weak dominance for short. The main difference between the analysis of the epistemic conditions of iterated weak dominance given in (...) this paper and other analysis is that we use a semi-qualitative approach to uncertainty based on the notion of plausibility first introduced by Spohn, whereas other analysis are based on a quantitative representation of uncertainty in terms of probabilities. (shrink)

We show, for any ordinal γ ≥ 3, that the class RaCAγ is pseudo-elementary and has a recursively enumerable elementary theory. ScK denotes the class of strong subalgebras of members of the class K. We devise games, Fⁿ (3 ≤ n ≤ ω), G, H, and show, for an atomic relation algebra A with countably many atoms, that Ǝ has a winning strategy in Fω(At(A)) ⇔ A ∈ ScRaCAω, Ǝ has a winning strategy in Fⁿ(At(A)) ⇐ A ∈ ScRaCAn, Ǝ (...) has a winning strategy in G(At(A)) ⇐ A ∈ RaCAω, Ǝ has a winning strategy in H(At(A)) ⇒ A ∈ RaRCAω for 3 ≤ n < ω. We use these games to show, for γ ≥ 5 and any class K of relation algebras satisfying RaRCAγ ⊆ K ⊆ ScRaCA₅, that K is not closed under subalgebras and is not elementary. For infinite γ, the inclusion RaCAγ ⊂ ScRaCAγ is strict. For infinite γ and for a countable relation algebra A we show that A has a complete representation if and only if A is atomic and Ǝ has a winning strategy in F(At(A)) if and only if A is atomic and A ∈ ScRaCAγ. (shrink)

In this paper, we interpret a 19th century diagram, which is meant to visualise G.W.F. Hegel’s entire method of the `Science of Logic' on the basis of bitwise operations. For the interpretation of the diagram we use a binary numeral system, and discuss whether the anti-Hegelian argument associated with it is valid or not. The reinterpretation is intended to make more precise rules of construction, a stricter binary code and a review of strengths and weaknesses of the critique.

SummaryTruth‐definitions play a crucial role in the foundations of logic and semantics. Tarsik‐type truth‐definitions are not possible to formulate in a usual first‐order language for itself, and they have been criticized because they do not account for what makes them definitions of truth. It has been suggested that truth should instead be characterized by reference to the «language‐games» of verification and falsification. The author's game‐theoretical semantics here explained for formal first‐order languages, can be thought of as a realization of (...) this idea. More technically speaking, GTS can also be thought of as a systematization of the well‐known aepsilon‐delta, definitions in the foundations of analysis. In GTS, truth is not defined by reference to winning a play of a game, but as the existence of a winning strategy in the game for the verifier. In a first‐order language, the game‐theoretical truth‐condition of a sentence S can accordingly be expressed by an explicit second‐order sentence asserting the existence of the Skolem function of S.The semantical games of GTS must be distinguished not only from the «games» of formal proof but also from the «games» in volved in our ordinary activities of verification and falsification. The latter have been modelled as games of inquiry by the author, and they are essentially epistemic games where the meaning of truth is taken for granted and where the aim of the game is to come to know certain truths. To assimilate them to the semantical games constitutive of truth is a form of Meno's paradox. (shrink)