We give a complete axiomatization of the identities of the basic game algebra valid with respect to the abstract game board semantics. We also show that the additional conditions of termination and determinacy of game boards do not introduce new valid identities.En route we introduce a simple translation of game terms into plain modal logic and thus translate, while preserving validity both ways, game identities into modal formulae.The completeness proof is based on reduction of (...) game terms to a certain ‘minimal canonical form’, by using only the axiomatic identities, and on showing that the equivalence of two minimal canonical terms can be established from these identities. (shrink)

On a very natural conception of sets, every set has an absolute complement. The ordinary cumulative hierarchy dismisses this idea outright. But we can rectify this, whilst retaining classical logic. Indeed, we can develop a boolean algebra of sets arranged in well-ordered levels. I show this by presenting Boolean Level Theory, which fuses ordinary Level Theory (from Part 1) with ideas due to Thomas Forster, Alonzo Church, and Urs Oswald. BLT neatly implement Conway’s games and surreal numbers; and a (...) natural extension of BLT is definitionally equivalent with ZF. (shrink)

I defend an analog of probabilism that characterizes rationally coherent estimates for chances. Specifically, I demonstrate the following accuracy-dominance result for stochastic theories in the C*-algebraic framework: supposing an assignment of chance values is possible if and only if it is given by a pure state on a given algebra, your estimates for chances avoid accuracy-dominance if and only if they are given by a state on that algebra. When your estimates avoid accuracy-dominance (roughly: when you cannot guarantee (...) that other estimates would be more accurate), I say that they are sufficiently coherent. In formal epistemology and quantum foundations, the notion of rational coherence that gets more attention requires that you never allow for a sure loss (or “Dutch book”) in a given sort of betting game; I call this notion full coherence. I characterize when these two notions of rational coherence align, and I show that there is a quantum state giving estimates that are sufficiently coherent, but not fully coherent. (shrink)

Mathematical formalism is the the view that numbers are "signs" and that arithmetic is like a game played with such signs. Frege's colleague Thomae defended formalism using an analogy with chess, and Frege's critique of this analogy has had a major influence on discussions in analytic philosophy about signs, rules, meaning, and mathematics. Here I offer a new interpretation of formalism as defended by Thomae and his predecessors, paying close attention to the mathematical details and historical context. I argue (...) that for Thomae, the formal standpoint is an _algebraic perspective_ on a domain of objects, and a "sign" is not a linguistic expression or mark, but a representation of an object within that perspective. Thomae exploits a shift into this perspective to give a purely algebraic construction of the real numbers from the rational numbers. I suggest that Thomae's chess analogy is intended to provide a model for such shifts in perspective. (shrink)

A general characterization of logical opposition is given in the present paper, where oppositions are defined by specific answers in an algebraic question-answer game. It is shown that opposition is essentially a semantic relation of truth values between syntactic opposites, before generalizing the theory of opposition from the initial Apuleian square to a variety of alter- native geometrical representations. In the light of this generalization, the famous problem of existential import is traced back to an ambiguous interpretation of assertoric (...) sentences in Aristotle's traditional logic. Following Abelard’s distinction between two alternative readings of the O-vertex: Non omnis and Quidam non, a logical difference is made between negation and denial by means of a more fine- grained modal analysis. A consistent treatment of assertoric oppositions is thus made possible by an underlying abstract theory of logical opposition, where the central concept is negation. A parallel is finally drawn between opposition and consequence, laying the ground for future works on an abstract operator of opposition that would characterize logical negation just as does Tarski’s operator of consequence for logical truth. (shrink)

This thirteenth volume of Collected Papers is an eclectic tome of 88 papers in various fields of sciences, such as astronomy, biology, calculus, economics, education and administration, game theory, geometry, graph theory, information fusion, decision making, instantaneous physics, quantum physics, neutrosophic logic and set, non-Euclidean geometry, number theory, paradoxes, philosophy of science, scientific research methods, statistics, and others, structured in 17 chapters (Neutrosophic Theory and Applications; Neutrosophic Algebra; Fuzzy Soft Sets; Neutrosophic Sets; Hypersoft Sets; Neutrosophic Semigroups; Neutrosophic Graphs; (...) Superhypergraphs; Plithogeny; Information Fusion; Statistics; Decision Making; Extenics; Instantaneous Physics; Paradoxism; Mathematica; Miscellanea), comprising 965 pages, published between 2005-2022 in different scientific journals, by the author alone or in collaboration with the following 110 co-authors (alphabetically ordered) from 26 countries: Abduallah Gamal, Sania Afzal, Firoz Ahmad, Muhammad Akram, Sheriful Alam, Ali Hamza, Ali H. M. Al-Obaidi, Madeleine Al-Tahan, Assia Bakali, Atiqe Ur Rahman, Sukanto Bhattacharya, Bilal Hadjadji, Robert N. Boyd, Willem K.M. Brauers, Umit Cali, Youcef Chibani, Victor Christianto, Chunxin Bo, Shyamal Dalapati, Mario Dalcín, Arup Kumar Das, Elham Davneshvar, Bijan Davvaz, Irfan Deli, Muhammet Deveci, Mamouni Dhar, R. Dhavaseelan, Balasubramanian Elavarasan, Sara Farooq, Haipeng Wang, Ugur Halden, Le Hoang Son, Hongnian Yu, Qays Hatem Imran, Mayas Ismail, Saeid Jafari, Jun Ye, Ilanthenral Kandasamy, W.B. Vasantha Kandasamy, Darjan Karabašević, Abdullah Kargın, Vasilios N. Katsikis, Nour Eldeen M. Khalifa, Madad Khan, M. Khoshnevisan, Tapan Kumar Roy, Pinaki Majumdar, Sreepurna Malakar, Masoud Ghods, Minghao Hu, Mingming Chen, Mohamed Abdel-Basset, Mohamed Talea, Mohammad Hamidi, Mohamed Loey, Mihnea Alexandru Moisescu, Muhammad Ihsan, Muhammad Saeed, Muhammad Shabir, Mumtaz Ali, Muzzamal Sitara, Nassim Abbas, Munazza Naz, Giorgio Nordo, Mani Parimala, Ion Pătrașcu, Gabrijela Popović, K. Porselvi, Surapati Pramanik, D. Preethi, Qiang Guo, Riad K. Al-Hamido, Zahra Rostami, Said Broumi, Saima Anis, Muzafer Saračević, Ganeshsree Selvachandran, Selvaraj Ganesan, Shammya Shananda Saha, Marayanagaraj Shanmugapriya, Songtao Shao, Sori Tjandrah Simbolon, Florentin Smarandache, Predrag S. Stanimirović, Dragiša Stanujkić, Raman Sundareswaran, Mehmet Șahin, Ovidiu-Ilie Șandru, Abdulkadir Șengür, Mohamed Talea, Ferhat Taș, Selçuk Topal, Alptekin Ulutaș, Ramalingam Udhayakumar, Yunita Umniyati, J. Vimala, Luige Vlădăreanu, Ştefan Vlăduţescu, Yaman Akbulut, Yanhui Guo, Yong Deng, You He, Young Bae Jun, Wangtao Yuan, Rong Xia, Xiaohong Zhang, Edmundas Kazimieras Zavadskas, Zayen Azzouz Omar, Xiaohong Zhang, Zhirou Ma.‬‬‬‬‬‬‬‬. (shrink)

In this fourteenth book of scilogs – one may find topics on examples where neutrosophics works and others don’t, law of included infinitely-many-middles, decision making in games and real life through neutrosophic lens, sociology by neutrosophic methods, Smarandache multispace, algebraic structures using natural class of intervals, continuous linguistic set, cyclic neutrosophic graph, graph of neutrosophic triplet group , how to convert the crisp data to neutrosophic data, n-refined neutrosophic set ranking, adjoint of a square neutrosophic matrix, neutrosophic optimization, de-neutrosophication, the (...) n-ary soft set relationship, hypersoft set, extending the hypergroupoid to the superhypergroupoid, alternative ranking, Dezert-Smarandache Theory (DSmT), reconciliation between theoretical and market prices, extension of the MASS model by the incorporation of neutrosophic statistics and the DSmT combination rule, conditional probability of actually detecting a financial fraud, neutrosophic extension using DSmT combination rule, probabilistic information content, absolute and relative DSm conditioning rules, example of PCR5 with Zhang’s degree, PCR5 with degree of intersection, the most general form of SuperHyperAlgebra, on Crittenden and Vanden Eynden’s conjecture, use of special types of linear algebras and their generalizations, SuperMathematics, 3D-space in physics, neutrosophic physical laws, neutrosophy as a meta-philosophy, principle of interconvertibility matter-energy-information, neutrosophic philosophical interpretation, possible neutrosophic applications to Indian philosophy and religion, philosophical horizons in neutrosophy, clan capitalism, or artificial intelligence – email messages to research colleagues, or replies, notes, comments, remarks about authors, articles, or books, spontaneous ideas, and so on. Exchanging ideas with Mirela Teodorescu, Linfan Mao, Shondiin Silversmith, Mumtaz Ali, Vasantha W.B. Kandasamy, V. Lakshmana Gomathi Nayagam, Bharanidharan R., Michael Voskoglou, Said Broumi, Maissam Jdid, Sagvan Y. Musa, Mohammad Hamidi, Yaser Ahmad Alhasan, Nivetha Martin, Mohammad Khoshnevisan, Deqiang Han, Jean Dezert, Mircea Șelariu, Ștefan Vlăduțescu, Tudor Păroiu (in order of reference in the book). (shrink)

Continuing his series of books on the mathematics of gambling, the author shows how a simple-rule game such as roulette is suited to a complex mathematical model whose applications generate improved betting systems that take into account a player's personal playing criteria. The book is both practical and theoretical, but is mainly devoted to the application of theory. About two-thirds of the content is lists of categories and sub-categories of improved betting systems, along with all the parameters that might (...) stand as the main objective criteria in a personal strategy - odds, profits and losses. The work contains new and original material not published before. The mathematical chapter describes complex bets, the profit function, the equivalence between bets and all their properties. All theoretical results are accompanied by suggestive concrete examples and can be followed by anyone with a minimal mathematical background because they involve only basic algebraic skills and set theory basics. The reader may also choose to skip the math and go directly to the sections containing applications, where he or she can pick desired numerical results from tables. The book offers no new so-called winning strategies, although it discusses them from a mathematical point of view. It does, however, offer improved betting systems and helps to organize a player's choices in roulette betting, according to mathematical facts and personal strategies. It is a must-have roulette handbook to be studied before placing your bets on the turn of either a European or American roulette wheel. (shrink)

The present dissertation presents an examination of the Carrollian logic through the reconstruction of its syllogistic theory. Lewis Carroll was one of the main responsible for the dissemination of logic during the nineteenth century, but most of his logical writings remained unknown until a posthumous publication of 1977. The reconstruction of the Carrollian syllogistic theory was based on the comparison of the two books on author's logic, "The Game of Logic" and "Symbolic Logic". The analysis of the Carrollian syllogistics (...) starts from a study of the historical context of development of the logic and the developments of syllogistics previous to the contribution of the author. Situated in the historical period of algebraical logic, Carrollian syllogistics is characterized as a conservative extension of the Aristotelian syllogistics, the main innovation is the use of negative terms and the introduction of a diagrammatic method suitable for the representation of negative terms. The diagrammatic method of the Carrollian syllogistics presents advances in relation to the methods of Euler and Venn. The use of negative terms also requires a redefinition of the notion of syllogism, simplifying and expanding the amount of arguments amenable to logical treatment. Carroll does not use four, but only three categorical propositions in his syllogistic, with interpretation of existential presuppositions congruent with a syntactic-existential reading. Carrollian syllogistics uses some techniques found in the work of algebraists of logic and also made the same confusions between notions of "class" and "member" that were common in the period. Convinced of the social utility of logic and dedicated to popularize it, Carroll priorized a creation of new didactics for the teaching of logic in his works, where he can include his diagrammatic method of solving syllogisms. Carroll made only scant considerations of his conception of logic. Based on the small considerations found throughout the study and on the constant claim of the social utility of logic, it is suggested that Carroll is close to the so-called pragmatic position, which considers a logic as an instrument of regulation of discourse. (shrink)

We develop a simple framework called ‘natural topology’, which can serve as a theoretical and applicable basis for dealing with real-world phenomena.Natural topology is tailored to make pointwise and pointfree notions go together naturally. As a constructive theory in BISH, it gives a classical mathematician a faithful idea of important concepts and results in intuitionism. -/- Natural topology is well-suited for practical and computational purposes. We give several examples relevant for applied mathematics, such as the decision-support system Hawk-Eye, and various (...) real-number representations. -/- We compare classical mathematics (CLASS), intuitionistic mathematics (INT), recursive mathematics (RUSS), Bishop-style mathematics (BISH) and formal topology, aiming to reduce the mutual differences to their essence. To do so, our mathematical foundation must be precise and simple. There are links with physics, regarding the topological character of our physical universe. -/- Any natural space is isomorphic to a quotient space of Baire space, which therefore is universal. We develop an elegant and concise ‘genetic induction’ scheme, and prove its equivalence on natural spaces to a formal-topological induction style. The inductive Heine-Borel property holds for ‘compact’ or ‘fanlike’ natural subspaces, including the real interval [g, h]. Inductive morphisms respect this Heine-Borel property, inversely. This partly solves the continuous-function problem for BISH, yet pointwise problems persist in the absence of Brouwer’s Thesis. -/- By inductivizing the definitions, a direct correspondence with INT is obtained which allows for a translation of many intuitionistic results into BISH. We thus prove a constructive star-finitary metrization theorem which parallels the classical metrization theorem for strongly paracompact spaces. We also obtain non-metrizable Silva spaces, in infinite-dimensional topology. Natural topology gives a solid basis, we think, for further constructive study of topological lattice theory, algebraic topology and infinite-dimensional topology. The final section reconsiders the question of which mathematics to choose for physics. Compactness issues also play a role here, since the question ‘can Nature produce a non-recursive sequence?’ finds a negative answer in CTphys . CTphys , if true, would seem at first glance to point to RUSS as the mathematics of choice for physics. To discuss this issue, we wax more philosophical. We also present a simple model of INT in RUSS, in the two-players game LIfE. (shrink)

Games occupy a unique and valuable place in our lives. Game designers do not simply create worlds; they design temporary selves. Game designers set what our motivations are in the game and what our abilities will be. Thus: games are the art form of agency. By working in the artistic medium of agency, games can offer a distinctive aesthetic value. They support aesthetic experiences of deciding and doing. -/- And the fact that we play games shows something (...) remarkable about us. Our agency is more fluid than we might have thought. In playing a game, we take on temporary ends; we submerge ourselves temporarily in an alternate agency. Games turn out to be a vessel for communicating different modes of agency, for writing them down and storing them. Games create an archive of agencies. And playing games is how we familiarize ourselves with different modes of agency, which helps us develop our capacity to fluidly change our own style of agency. (shrink)

Games may seem like a waste of time, where we struggle under artificial rules for arbitrary goals. The author suggests that the rules and goals of games are not arbitrary at all. They are a way of specifying particular modes of agency. This is what make games a distinctive art form. Game designers designate goals and abilities for the player; they shape the agential skeleton which the player will inhabit during the game. Game designers work in the (...) medium of agency. Game-playing, then, illuminates a distinctive human capacity. We can take on ends temporarily for the sake of the experience of pursuing them. Game play shows that our agency is significantly more modular and more fluid than we might have thought. It also demonstrates our capacity to take on an inverted motivational structure. Sometimes we can take on an end for the sake of the activity of pursuing that end. (shrink)

This paper investigates a generalization of Boolean algebras which I call agglomerative algebras. It also outlines two conceptions of propositions according to which they form an agglomerative algebra but not a Boolean algebra with respect to conjunction and negation.

We present an algebraic account of the Tongan kinship terminology (TKT) that provides an insightful journey into the fabric of Tongan culture. We begin with the ethnographic account of a social event. The account provides us with the activities of that day and the centrality of kin relations in the event, but it does not inform us of the conceptual system that the participants bring with them. Rather, it is a slice in time of an ongoing dynamic process that links (...) behavior with a conceptual system of kin relations and vice versa. To understand this interplay, we need an account of the underlying conceptual system that is being activated during the event. Thus, we introduce a formal, algebraically based account of TKT. This account brings to the fore the underlying logic of TKT and allows us to distinguish between features of the kinship system that arise from the logic of TKT as a generative structure and features that must have arisen through cultural intervention. (shrink)

Katie Steele and H. Orri Stefánsson argue that, to reflect an agent’s limited awareness, the algebra of propositions on which that agent’s credences are defined should be relativised to their awareness state. I argue that this produces insurmountable difficulties. But the project of relativising the agent’s algebra to reflect their partial perspective need not be abandoned: the algebra can be relativised, not to the agent’s awareness state, but to what we might call their subjective modality.

Game theorists tend to model climate negotiations as a so-called ‘tragedy of the commons’. This is rather worrisome, since the conditions under which such commons problems have historically been solved are almost entirely absent in the case of international greenhouse gas emissions. In this paper, I will argue that the predictive accuracy of the tragedy model might not stem from the model’s inherent match with reality but rather from the model’s ability to make self-fulfilling predictions. I then sketch some (...) possible ways to dispel the tragedy, including (1) recognizing some ways the assumptions of the model fail, (2) taking seriously recent work suggesting that increasing greenhouse gas emissions is not in most nations’ own self-interest, and (3) preferring alternative models like collective risk dilemmas, bargaining games, or cooperative models. (shrink)

This article explores the nature and theoretical import of a hitherto neglected class of fictions which we term ‘self-involving interactive fictions’. SIIFs are interactive fictions, but they differ from standard examples of interactive fictions by being, in some important sense, about those who consume them. In order to better understand the nature of SIIFs, and the ways in which they differ from other fictions, we focus primarily on the most prominent example of the category: video-game fictions. We argue that (...) appreciating the self-involving nature of video-game fictions is key to understanding various otherwise puzzling phenomena concerning the ways in which consumers respond to them. Video-game fictions are, however, far from being the only extant example of this class; and we suggest that the recent philosophical interest in video games would be better focused on the wider class of self-involving interactive fictions. (shrink)

Hyperboolean algebras are Boolean algebras with operators, constructed as algebras of complexes (or, power structures) of Boolean algebras. They provide an algebraic semantics for a modal logic (called here a {\em hyperboolean modal logic}) with a Kripke semantics accordingly based on frames in which the worlds are elements of Boolean algebras and the relations correspond to the Boolean operations. We introduce the hyperboolean modal logic, give a complete axiomatization of it, and show that it lacks the finite model property. The (...) method of axiomatization hinges upon the fact that a "difference" operator is definable in hyperboolean algebras, and makes use of additional non-Hilbert-style rules. Finally, we discuss a number of open questions and directions for further research. (shrink)

In this paper we propose and analyze a game-theoretic model of the epistemology of peer disagreement. In this model, the peers' rationality is evaluated in terms of their probability of ending the disagreement with a true belief. We find that different strategies---in particular, one based on the Steadfast View and one based on the Conciliatory View---are rational depending on the truth-sensitivity of the individuals involved in the disagreement. Interestingly, the Steadfast and the Conciliatory Views can even be rational simultaneously (...) in some circumstances. We tentatively provide some reasons to favor the Conciliatory View in such cases. We argue that the game-theoretic perspective is a fruitful one in this debate, and this fruitfulness has not been exhausted by the present paper. (shrink)

Multialgebras have been much studied in mathematics and in computer science. In 2016 Carnielli and Coniglio introduced a class of multialgebras called swap structures, as a semantic framework for dealing with several Logics of Formal Inconsistency that cannot be semantically characterized by a single finite matrix. In particular, these LFIs are not algebraizable by the standard tools of abstract algebraic logic. In this paper, the first steps towards a theory of non-deterministic algebraization of logics by swap structures are given. Specifically, (...) a formal study of swap structures for LFIs is developed, by adapting concepts of universal algebra to multialgebras in a suitable way. A decomposition theorem similar to Birkhoff’s representation theorem is obtained for each class of swap structures. Moreover, when applied to the 3-valued algebraizable logics J3 and Ciore, their classes of algebraic models are retrieved, and the swap structures semantics become twist structures semantics. This fact, together with the existence of a functor from the category of Boolean algebras to the category of swap structures for each LFI, suggests that swap structures can be seen as non-deterministic twist structures. This opens new avenues for dealing with non-algebraizable logics by the more general methodology of multialgebraic semantics. (shrink)

There are well-known problems for formalist accounts of game-play with regards to cheating. Such accounts seem to be committed to cheaters being unable to win–or even play–the game, yet it seems that there are instances of cheaters winning games. In this paper, I expand the discussion of such problems by introducing cases of pre-game cheating, and see how a formalist–specifically a Suitsian–account can accommodate such problems. Specifically, I look at two (fictional) examples where the alleged game-players (...) cheat prior to a game-instance in such as a way as to cast doubt on whether the alleged game-players are truly playing the game. To escape the worries brought about by these examples of pre-game cheating, I will appeal to the concept of nested games. This concept will give us the needed tools to explain how the alleged players are cheating and how the alleged players are players. On the whole, this discussion should help illuminate some important issues with regards to cheating and rules on a Suitsian account of game-play, and help give support for formalist accounts more generally. (shrink)

In the recent years, problem-solving become a central topic that discussed by educators or researchers in mathematics education. it’s not only as the ability or as a method of teaching. but also, it is a little in reviewing about the components of the support to succeed in problem-solving, such as student's belief and attitude towards mathematics, algebraic thinking skills, resources and teaching materials. In this paper, examines the algebraic thinking skills as a foundation for problem-solving, and learning cycle as a (...) breath of continuous learning. In this paper, learning cycle to be used is a modified type of 5E based on beliefs. (shrink)

The Belnap–Dunn logic is a well-known and well-studied four-valued logic, but until recently little has been known about its extensions, i.e. stronger logics in the same language, called super-Belnap logics here. We give an overview of several results on these logics which have been proved in recent works by Přenosil and Rivieccio. We present Hilbert-style axiomatizations, describe reduced matrix models, and give a description of the lattice of super-Belnap logics and its connections with graph theory. We adopt the point of (...) view ofAlgebraic Logic, exploring applications of the general theory of algebraization of logics to the super-Belnap family. In this respect we establish a number of new results, including a description of the algebraic counterparts, Leibniz filters, and strong versions of super-Belnap logics, as well as the classification of these logics within the Leibniz and Frege hierarchies. (shrink)

Philosophical games are games designed to invite players to think philosophically within (and about) their gameworlds. They are interactive fictions allowing players to engage with philosophical themes in ways that often set them apart from non-interactive kinds of speculative fictions (such as philosophical novels or thought experiments). To better understand philosophical games, this entry proposes to distinguish two primary ways in which a philosophical game can approach its themes: dialectically or rhetorically.

How do we prepare engineering students to make ethical and responsible decisions in their professional work? This paper presents an approach that enhances engineering students’ engagement with ethical reasoning by simulating decision-making in a complex scenario. The approach has two principal inspirations. The first is Anthony Weston’s scenario-based teaching. Weston’s concept of a scenario is a situation that changes in response to choices made by participants, according to an inner logic. Scenarios can dynamically explore open-ended complex problems without imposing predetermined (...) results, allowing students to apply their ethical reasoning in a more realistic fashion. The second inspiration is Thi Nguyen’s theory of games. According to Nguyen, games are the “art of agency,” meaning that they provide a structure under which some result is agreed to be valuable, along with prescribed ways of achieving that result, in a relatively low-stakes and temporary social arrangement. By playing many games, Nguyen argues, we can develop a “library of agency,” that is to say, a set of values and means to achieving them that can inform how we make high-stakes decisions in real life. Engaging with carefully designed game scenarios, then, can enable students to practice making ethical decisions within a structured framework, which unfolds in response to their choices, while their decisions are driven by some defined goal. This roleplaying game–based approach thus allows students to build their own ethical libraries of agency, in preparation for professional decision-making. The approach is illustrated using a specific example recently deployed in a seminar on engineered living materials (building materials that incorporate living tissues). The scenario uses techniques from tabletop roleplaying games (e.g. Dungeons & Dragons) for outcome resolution, adventure design, and character creation. Through the game, students practice making difficult decisions in a humanitarian context. (shrink)

This is a reply to Elisabeth Camp's and Elijah Millgram's probing discussions of "Games and the Art of Agency", in a symposium in Journal of Ethics and Social Philosophy. Millgram argues that games cannot function as a guide to life, because they are too different from life. Games are limited in a special way: in life, we deliberate about what goals we want to take on, but in games, the goals are fixed and given to us. Camp argues that there (...) is nothing particularly special about games, because the fluidity of agency is all over ordinary life too - games are just like ordinary life. I respond to Millgram: we do deliberate about our ends, in games, when we aesthetically reflect on which games to play. And I respond to Camp: games are distinctive in the way they regulate how our reasons flow across the game/life border. To respond to these criticisms, I add some substantial new features to my account of the motivational structure of game-play. (shrink)

This is my reply to commentators in the symposium on my book, GAMES: AGENCY AS ART. The symposium features commentary by Thomas Hurka, Quill Kukla, and Alva Noe, and originally appeared in Analysis 81 (2).

Watching other people play videogames —a.k.a. ‘spectator gaming’— is a widespread practice. Yet, it is considered by some as an inadequate form of engagement with games. In this paper, I show that the strongest objection to spectator gaming relies on the claim that some properties of videogames are better, if not exclusively, accessible to the player. After that, I propose two replies to this challenge. The first is that ‘secondary players’, i.e., individuals who indirectly take part in the game, (...) can access the relevant properties. The second reply is that even paradigmatic spectators may engage in simulated play, and therefore, access these properties as well. (shrink)

What is a game? What are we doing when we play a game? What is the value of playing games? Several different philosophical subdisciplines have attempted to answer these questions using very distinctive frameworks. Some have approached games as something like a text, deploying theoretical frameworks from the study of narrative, fiction, and rhetoric to interrogate games for their representational content. Others have approached games as artworks and asked questions about the authorship of games, about the ontology of (...) the work and its performance. Yet others, from the philosophy of sport, have focused on normative issues of fairness, rule application, and competition. The primary purpose of this article is to provide an overview of several different philosophical approaches to games and, hopefully, demonstrate the relevance and value of the different approaches to each other. Early academic attempts to cope with games tried to treat games as a subtype of narrative and to interpret games exactly as one might interpret a static, linear narrative. A faction of game studies, self-described as “ludologists,” argued that games were a substantially novel form and could not be treated with traditional tools for narrative analysis. In traditional narrative, an audience is told and interprets the story, where in a game, the player enacts and creates the story. Since that early debate, theorists have attempted to offer more nuanced accounts of how games might achieve similar ends to more traditional texts. For example, games might be seen as a novel type of fiction, which uses interactive techniques to achieve immersion in a fictional world. Alternately, games might be seen as a new way to represent causal systems, and so a new way to criticize social and political entities. Work from contemporary analytic philosophy of art has, on the other hand, asked questions whether games could be artworks and, if so, what kind. Much of this debate has concerned the precise nature of the artwork, and the relationship between the artist and the audience. Some have claimed that the audience is a cocreator of the artwork, and so games are a uniquely unfinished and cooperative art form. Others have claimed that, instead, the audience does not help create the artwork; rather, interacting with the artwork is how an audience member appreciates the artist's finished production. Other streams of work have focused less on the game as a text or work, and more on game play as a kind of activity. One common view is that game play occurs in a “magic circle.” Inside the magic circle, players take on new roles, follow different rules, and actions have different meanings. Actions inside the magic circle do not have their usual consequences for the rest of life. Enemies of the magic circle view have claimed that the view ignores the deep integration of game life from ordinary life and point to gambling, gold farming, and the status effects of sports. Philosophers of sport, on the other hand, have approached games with an entirely different framework. This has lead into investigations about the normative nature of games—what guides the applications of rules and how those rules might be applied, interpreted, or even changed. Furthermore, they have investigated games as social practices and as forms of life. (shrink)

On Bernard Suits’s celebrated analysis, to play a game is to engage in a ‘voluntary attempt to overcome unnecessary obstacles’. Voluntariness is understood in terms of the players having the ‘lusory attitude’ of accepting the constitutive rules of the game just because they make possible playing it. In this paper I suggest that the players in Netflix’s hit show Squid Game play the ‘squid games’, but they do not do so voluntarily; they are forced to play. I (...) argue that this means that we should rethink Suits’s analysis by claiming that all that is needed for players to play is that someone has put the rules in force for them for the reason that it makes playing the game possible. I then illustrate the virtues of the revised analysis by showing how it helps us to defuse Hurka’s recent counterexamples to Suits’s view. (shrink)

The logico-algebraic study of Lewis's hierarchy of variably strict conditional logics has been essentially unexplored, hindering our understanding of their mathematical foundations, and the connections with other logical systems. This work aims to fill this gap by providing a comprehensive logico-algebraic analysis of Lewis's logics. We begin by introducing novel finite axiomatizations for varying strengths of Lewis's logics, distinguishing between global and local consequence relations on Lewisian sphere models. We then demonstrate that the global consequence relation is strongly algebraizable in (...) terms of a specific class of Boolean algebras with a binary operator representing the counterfactual implication; in contrast, we show that the local consequence relation is generally not algebraizable, although it can be characterized as the degree-preserving logic over the same algebraic models. Further, we delve into the algebraic semantics of Lewis's logics, developing two dual equivalences with respect to particular topological spaces. In more details, we show a duality with respect to the topological version of Lewis's sphere models, and also with respect to Stone spaces with a selection function; using the latter, we demonstrate the strong completeness of Lewis's logics with respect to sphere models. Finally, we draw some considerations concerning the limit assumption over sphere models. (shrink)

The paper has a twofold aim. On the one hand, it provides what appears to be the first game-theoretic modeling of Napoleon’s last campaign, which ended dramatically on 18 June 1815 at Waterloo. It is specifically concerned with the decision Napoleon made on 17 June 1815 to detach part of his army against the Prussians he had defeated, though not destroyed, on 16 June at Ligny. Military historians agree that this decision was crucial but disagree about whether it was (...) rational. Hypothesizing a zero-sum game between Napoleon and Blücher, and computing its solution, we show that it could have been a cautious strategy on the former's part to divide his army, a conclusion which runs counter to the charges of misjudgement commonly heard since Clausewitz. On the other hand, the paper addresses methodological issues. We defend its case study against the objections of irrelevance that have been raised elsewhere against “analytic narratives”, and conclude that military campaigns provide an opportunity for successful application of the formal theories of rational choice. Generalizing the argument, we finally investigate the conflict between narrative accounts – the historians' standard mode of expression – and mathematical modeling. (shrink)

What can the philosophy of agency learn from Nguyen’s book on games? The most important lesson concerns, to use Nguyen’s terms, the ‘layered’ structure of our agency and the ‘fluidity’ requ...

Godfrey-Smith advocates for linking deception in sender-receiver games to the existence of undermining signals. I present games in which deceptive signals can be arbitrarily frequent, without this undermining information transfer between sender and receiver.

When game theory was introduced to biology, the components of classic game theory models were replaced with elements more befitting evolutionary phenomena. The actions of intelligent agents are replaced by phenotypic traits; utility is replaced by fitness; rational deliberation is replaced by natural selection. In this paper, I argue that this classic conception of comprehensive reapplication is misleading, for it overemphasizes the discontinuity between human behavior and evolved traits. Explicitly considering the representational roles of evolutionary game theory (...) brings to attention neglected areas of overlap, as well as a range of evolutionary possibilities that are often overlooked. The clarifications this analysis provides are well-illustrated by—and particularly valuable for—game theoretic treatments of the evolution of social behavior. (shrink)

Is capitalism inherently predatory? Must there be winners and losers? Is public interest outdated and free-riding rational? Is consumer choice the same as self-determination? Must bargainers abandon the no-harm principle? Prisoners of Reason recalls that classical liberal capitalism exalted the no-harm principle. Although imperfect and exclusionary, modern liberalism recognized individual human dignity alongside individuals' responsibility to respect others. Neoliberalism, by contrast, views life as ceaseless struggle. Agents vie for scarce resources in antagonistic competition in which every individual seeks dominance. This (...) political theory is codified in non-cooperative game theory; the neoliberal citizen and consumer is the strategic rational actor. Rational choice justifies ends irrespective of means. Money becomes the medium of all value. Solidarity and good will are invalidated. Relationships are conducted on a quid pro quo basis. However, agents can freely opt out of this cynical race to the bottom by embracing a more expansive range of coherent action. (shrink)

Many philosophers think that games like chess, languages like English, and speech acts like assertion are constituted by rules. Lots of others disagree. To argue over this productively, it would be first useful to know what it would be for these things to be rule-constituted. Searle famously claimed in Speech Acts that rules constitute things in the sense that they make possible the performance of actions related to those things (Searle 1969). On this view, rules constitute games, languages, and speech (...) acts in the sense that they make possible playing them, speaking them and performing them. This raises the question what it is to perform rule-constituted actions (e. g. play, speak, assert) and the question what makes constitutive rules distinctive such that only they make possible the performance of new actions (e. g. playing). In this paper I will criticize Searle’s answers to these questions. However, my main aim is to develop a better view, explain how it works in the case of each of games, language, and assertion and illustrate its appeal by showing how it enables rule-based views of these things to respond to various objections. (shrink)

A predicate of personal taste occurring in a sentence in which the perspectival information is not linguistically articulated by an experiencer phrase may have two different readings. In case the speaker of a bare sentence formed with a predicate of personal taste uses the subjective predicate encoding perspectival information in one way and the hearer interprets it in another way, the agents’ acts are not coordinated. In this paper I offer an answer to the question of how a hearer can (...) strategically interact with a speaker on the intended perspectival information so that both agents can optimally solve their coordination problem. In this sense, I offer a game-theoretical account of the strategic communication with expressions referring to agents’ perspectives, communication which involves the interaction between a speaker who intends to convey some perspectival information and who chooses to utter a bare sentence formed with a predicate of personal taste, instead of a sentence in which the perspectival information is linguistically articulated by an experiencer phrase, and a hearer who has to choose between interpreting the uttered sentence in conformity with the speaker’s autocentric use of the predicate of personal taste or in conformity with the speaker’s exocentric use. (shrink)

A philosophical theory of explanation should provide solutions to a series of problems, both descriptive and normative. The aim of this essay is to establish the claim that this can be best done if one theorizes in terms of explanatory games rather than focusing on the explication of the concept of explanation. The position that is adopted is that of an explanatory pluralism and it is elaborated in terms of the rules that incorporate the normative standards that guide the processes (...) of discovery and justification of explanations as well as the modes of their communication, dissemination, and adoption. They constitute the rules of the explanatory game that the participants are playing. The philosophical project consists in describing and normatively appraising the rules that constitute these games. (shrink)

Increase in popularity of games like "Second Life" has contributed not only to significant changes in the development of the electronic entertainment industry. Promoting Games 2.0, the new trend of video game production that are assumed to be the virtual worlds that contain user-generated content makes both measured with a specific technological innovation, as well as a serious change in the organization of socio-cultural heritage. The article presents problems of the existing difficulties of terminology, the implications of the availability (...) of Games 2.0 for social life, the concept of leisure as work in the new economy and creative non-material and the characteristics of "Generation C". Work stresses the need for discussion on trends in the development of video games - defined as a choice between the projects’ of "socio-cultural ideology of perpetual motion" and "utopia of universal creativity". These approaches allow to identify the methodological basis for analysis of relations between the operators and users of Games 2.0, taking into account the wider social environment. ** Wzrost popularności gier typu „Second Life” przyczynił siȩ nie tylko do znacznych przemian w rozwoju branży rozrywki elektronicznej. Upowszechnianie Games 2.0, nowego nurtu produkcji gier wideo które z założenia maj¸a} stanowić wirtualne światy zawieraj¸a}ce treści tworzone przez użytkowników sprawia, że mierzymy siȩ zarówno z określon¸a} innowacj¸a} technologiczn¸a}, jak też z poważn¸a} zmian¸a} organizacji życia społeczno-kulturowego. Artykuł przedstawia problematykȩ istniej¸acych trudności terminologicznych, konsekwencje dostȩpności Games 2.0 dla życia społecznego, pojȩcie rozrywki jako pracy w nowej gospodarce niematerialnej i twórczej oraz charakterystykȩ „generacji C”. Praca podkreśla potrzebȩ dyskusji nad kierunkami rozwoju gier wideo - określanymi jako wybór miȩdzy projektami „ideologii społeczno-kulturowego perpetuum mobile” i „utopii powszechnej twórczości”. Podejścia te pozwalaj¸a na wskazanie podstaw metodologicznych do prowadzenia analiz relacji miȩdzy operatorami, a użytkownikami Games 2.0 przy uwzglȩdnieniu szerszego otoczenia społecznego. (shrink)

Persons with aphasia suffer from a loss of communication ability as a consequence of a brain injury. A small strand of research indicates effec- tiveness of dialogic interventions for communication development for persons with aphasia, but a vast amount of research studies shows its effectiveness for other target groups. In this paper, we describe the main parts of the hitherto technological development of an application named Dialogica that is (i) aimed at facilitating increased communicative participation in dialogic settings for persons (...) with aphasia and other communication disorders, (ii) based on comput- er game technology as well as on theory in dialogic education and argumenta- tion theory, and (iii) designed for mobile devices with larger screens. (shrink)

The purpose of this study is to compile a selection of the various formalisms found in conversation theory to introduce readers to Pask's discursive algebra. In this way, the text demonstrates how concept sharing and concept formation by means of the interaction of two participants may be formalized. The approach taken in this study is to examine the formal notation system used by Pask and demonstrate how such formalisms may be used to represent concept sharing and concept formation through (...) conversation. The compilation of the discursive algebra using the framework provided by conversation theory could potentially be used as an auxiliary framework to study conversational interactions in multi-agent systems theory. (shrink)

Causal reasoning and game-theoretic reasoning are fundamental topics in artificial intelligence, among many other disciplines: this paper is concerned with their intersection. Despite their importance, a formal framework that supports both these forms of reasoning has, until now, been lacking. We offer a solution in the form of (structural) causal games, which can be seen as extending Pearl's causal hierarchy to the game-theoretic domain, or as extending Koller and Milch's multi-agent influence diagrams to the causal domain. We then (...) consider three key questions: i) How can the (causal) dependencies in games - either between variables, or between strategies - be modelled in a uniform, principled manner? ii) How may causal queries be computed in causal games, and what assumptions does this require? iii) How do causal games compare to existing formalisms? To address question i), we introduce mechanised games, which encode dependencies between agents' decision rules and the distributions governing the game. In response to question ii), we present definitions of predictions, interventions, and counterfactuals, and discuss the assumptions required for each. Regarding question iii), we describe correspondences between causal games and other formalisms, and explain how causal games can be used to answer queries that other causal or game-theoretic models do not support. Finally, we highlight possible applications of causal games, aided by an extensive open-source Python library. (shrink)

El objetivo de este artículo es presentar una demostración de un teorema clásico sobre álgebras booleanas y ordenes parciales de relevancia actual en teoría de conjuntos, como por ejemplo, para aplicaciones del método de construcción de modelos llamado “forcing” (con álgebras booleanas completas o con órdenes parciales). El teorema que se prueba es el siguiente: “Todo orden parcial se puede extender a una única álgebra booleana completa (salvo isomorfismo)”. Donde extender significa “sumergir densamente”. Tal demostración se realiza utilizando cortaduras de (...) Dedekind siguiendo el texto “Set Theory” de Jech, y otras ideas propias del autor de este artículo. Adicionalmente, se formulan algunas versiones débiles del axioma de elección relacionadas con las álgebras booleanas, las cuales son también de gran importancia para la investigación en teoría de conjuntos y teoría de modelos, pues estas son poderosas técnicas de construcción de modelos, como por ejemplo, el teorema de compacidad (permite construir modelos no estándar, etc) y el teorema del ultrafiltro, que permite construir ultraproductos (pueden ser usados para investigar problemas de cardinales grandes, etc). Se presentan algunas referencias de problemas abiertos sobre el tema. -/- The objective of this paper is to present a demonstration of a classical theorem on boolean algebras and partial orders of current relevance in set theory, as for example, for applications of model construction method called forcing" (with boolean algebras complete or with partial orders). The theorem to be proved is as follows: Any partial order can be extended to a single complete boolean algebra (up to isomorphism)". Where to extend means embed densely". Such a demonstration is done using Dedekind's cuts following the text Set Theory" of Jech, and other ideas of the author of this article. In addition, some weak versions of the axiom of choice related to boolean algebras are formulated, which are also of great importance for the research in set theory and model theory, since this are powerful model construction techniques, such as the compactness theorem (allows the construction of non-standard models, etc.) and the ultralter theorem, which allows the construction of ultraproducts (can be used to investigate problems of large cardinals, etc). Some references of open problems on the subject are presented. (shrink)

We introduce Pura Vida Neutrosophic Algebra, an algebraic structure consisting of neutrosophic numbers equipped with two binary operations namely addition and multiplication. The addition can be calculated sometimes with the function min and other times with the max function. The multiplication operation is the usual sum between numbers. Pura Vida Neutrosophic Algebra is an extension of both Tropical Algebra (also known as Min-Plus, or Min-Algebra) and Max-Plus Algebra (also known as Max-algebra). Tropical and Max-Plus (...) algebras are algebraic structures included in semirings and their operations can be used in matrices and vectors. Pura Vida Neutrosophic Algebra is included in Neutrosophic semirings and can be used in Neutrosophic matrices and vectors. (shrink)

The bi-polar confrontation between the Soviet Union and the USA involved many leading game theorists from both sides of the Iron Curtain: Oskar Morgenstern, John von Neumann, Michael Intriligator, John Nash, Thomas Schelling and Steven Brams from the United States and Nikolay Vorob’ev, Leon A. Petrosyan, Elena B. Yanovskaya and Olga N. Bondareva from the Soviet Union. The formalization of game theory took place prior to the Cold War but the geopolitical confrontation hastened and shaped its evolution. In (...) our article we outline four similarities and differences between Western GT and Soviet GT: 1) the Iron Curtain resulted in a lagged evolution of GT in the Soviet Union; 2) Soviet GT focused more on operations research and issues of centralized planning; 3) the contemporary Western view on Soviet GT was biased and Soviet contributions, including works on dynamic stability, non-emptiness of the core and many refinements, suggest that Soviet GT was able to catch up to the Western level relatively fast; 4) international conferences, including Vilnius, 1971, fostered interaction between Soviet game theorists and their Western colleagues. In general, we consider the Cold War to be a positive environment for GT in the West and in the Soviet Union. (shrink)

We propose a formal framework for interpretable machine learning. Combining elements from statistical learning, causal interventionism, and decision theory, we design an idealised explanation game in which players collaborate to find the best explanation for a given algorithmic prediction. Through an iterative procedure of questions and answers, the players establish a three-dimensional Pareto frontier that describes the optimal trade-offs between explanatory accuracy, simplicity, and relevance. Multiple rounds are played at different levels of abstraction, allowing the players to explore overlapping (...) causal patterns of variable granularity and scope. We characterise the conditions under which such a game is almost surely guaranteed to converge on a optimal explanation surface in polynomial time, and highlight obstacles that will tend to prevent the players from advancing beyond certain explanatory thresholds. The game serves a descriptive and a normative function, establishing a conceptual space in which to analyse and compare existing proposals, as well as design new and improved solutions. (shrink)

An elementary algebra identifies conceptual and corresponding applicational limitations in John Kemeny and Paul Oppenheim’s (K-O) 1956 model of theoretical reduction in the sciences. The K-O model was once widely accepted, at least in spirit, but seems afterward to have been discredited, or in any event superceeded. Today, the K-O reduction model is seldom mentioned, except to clarify when a reduction in the Kemeny-Oppenheim sense is not intended. The present essay takes a fresh look at the basic mathematics of (...) K-O comparative vocabulary theoretical term reductions, from historical and philosophical standpoints, as a contribution to the history of the philosophy of science. The K-O theoretical reduction model qualifies a theory replacement as a successful reduction when preconditions of explanatory adequacy and comparable systematicization are met, and there occur fewer numbers of theoretical terms identified as replicable syntax types in the most economical statement of a theory’s putative propositional truths, as compared with the theoretical term count for the theory it replaces. The challenge to the historical model developed here, to help explain its scope and limitations, involves the potential for equivocal theoretical meanings of multiple theoretical term tokens of the same syntactical type. (shrink)

The topics approached in the 52 papers included in this book are: neutrosophic sets; neutrosophic logic; generalized neutrosophic set; neutrosophic rough set; multigranulation neutrosophic rough set (MNRS); neutrosophic cubic sets; triangular fuzzy neutrosophic sets (TFNSs); probabilistic single-valued (interval) neutrosophic hesitant fuzzy set; neutro-homomorphism; neutrosophic computation; quantum computation; neutrosophic association rule; data mining; big data; oracle Turing machines; recursive enumerability; oracle computation; interval number; dependent degree; possibility degree; power aggregation operators; multi-criteria group decision-making (MCGDM); expert set; soft sets; LA-semihypergroups; single valued (...) trapezoidal neutrosophic number; inclusion relation; Q-linguistic neutrosophic variable set; vector similarity measure; fundamental neutro-homomorphism theorem; neutro-isomorphism theorem; quasi neutrosophic triplet loop; quasi neutrosophic triplet group; BE-algebra; cloud model; Maclaurin symmetric mean; pseudo-BCI algebra; hesitant fuzzy set; photovoltaic plan; decision-making trial and evaluation laboratory (DEMATEL); Choquet integral; fuzzy measure; clustering algorithm; and many more. (shrink)

A dialogue arguing that morality has an objective basis in the mathematical object describing the "tit for tat" game theory. To play the game, a contractual obligation is freely made to cooperate and to fairly distribute the gains. Failure to meet these obligations results in social punishment.