Not Every "Tabular" Predicate Logic is Finitely Axiomatizable

An example of finite tree Mo is presented such that its predicate logic (i.e. the intermediate predicate logic characterized by the class of all predicate Kripke frames based on Mo) is not finitely axiomatizable. Hence it is shown that the predicate analogue of de Jongh - McKay - Hosoi's theorem on the finite axiomatizability of every finite intermediate propositional logic is not true.     

What do you think I think you think?: Strategic reasoning in matrix games

In reasoning about strategic interpersonal situations, such as in playing games, an individual's representation of the situation often includes not only information about the goals and rules of the game, but also a mental model of other minds. Often such mental models involve a hierarchy of reflexive reasoning commonly employed in social situations ("What do you think I think you think..."), and may be related to the developmental notion of 'theory of mind'. In two experiments, the authors formally investigate such interpersonal recursive reasoning in college-age adults within the context of matrix games. Participants are asked to predict the moves of another player (experimenter's confederate) in a two-choice, sequential-move game that may terminate at various stages with different payoffs for each player. Participants are also asked to decide optimally on their own moves based on the prediction made. Errors concerning the prediction, or translation of those predictions into decisions about one's action, were recorded. Results demonstrate the existence of a "default" mental model about the other player in the game context that is dynamically modified as new evidence is accumulated. Predictions about this other player's behavior are, in general, used consistently in decision-making, though the opponent tends to be modeled, by default, to behave in a myopic fashion not anticipating the participant's own action.     

Perspective-taking and depth of theory-of-mind reasoning in sequential-move games

Theory-of-mind (ToM) involves modeling an individual's mental states to plan one's action and to anticipate others' actions through recursive reasoning that may be myopic (with limited recursion) or predictive (with full recursion). ToM recursion was examined using a series of two-player, sequential-move matrix games with a maximum of three steps. Participants were assigned the role of Player I, controlling the initial and the last step, or of Player II, controlling the second step. Appropriate for the assigned role, participants either anticipated or planned Player II's strategy at the second step, and then determined Player I's optimal strategy at the first step. Participants more readily used predictive reasoning as Player II (i.e., planning one's own move) than as Player I (i.e., anticipating an opponent's move), although they did not differ when translating reasoning outcome about the second step to optimal action in the first step. Perspective-taking influenced likelihood of predictive reasoning, but it did not affect the rate at which participants acquired it during the experimental block. We conclude that the depth of ToM recursion (related to perspective-taking mechanisms) and rational application of belief-desire to action (instrumental rationality) constitute separate cognitive processes in ToM reasoning.     

On the equivalence between elimination-by-aspects and generalised extreme value models of choice behaviour

Elimination-by-aspects and generalised extreme value offer competing paradigms for the representation of a common behaviour, that of individual discrete choice. Observing certain consistencies in their mathematical structure, several eminent authors have commented on the degree of equivalence between the two paradigms. Most contributions to this debate have, however, been less than definitive. More fundamentally, the contributions lack consensus. We advance the debate by establishing formal mathematical conditions under which three-alternative tree models from the two paradigms are exactly equivalent. We then extend our analysis to consider more general models, showing that equivalence can be established for general tree models, but not for cross-nested models.     

Bounded contraction and Gentzen-style formulation of Łukasiewicz logics

In this paper, we consider multiplicative-additive fragments of affine propositional classical linear logic extended with n-contraction. To be specific, n-contraction (n 2) is a version of the contraction rule where (n+ 1) occurrences of a formula may be contracted to n occurrences. We show that expansions of the linear models for (n + 1)- valued ukasiewicz logic are models for the multiplicative-additive classical linear logic, its affine version and their extensions with n-contraction. We prove the finite axiomatizability for the classes of finite models, as well as for the class of infinite linear models based on the set of rational numbers in the interval [0, 1]. The axiomatizations obtained in a Gentzen-style formulation are equivalent to finite and infinite-valued ukasiewicz logics.Presented by Jan Zygmunt     

On Intermediate Predicate Logics of some Finite Kripke Frames,I. Levelwise Uniform Trees

An intermediate predicate logic L is called finite iff it is characterized by a finite partially ordered set M, i.e., iff L is the logic of the class of all predicate Kripke frames based on M. In this paper we study axiomatizability of logics of this kind. Namely, we consider logics characterized by finite trees M of a certain type (levelwise uniform trees) and establish the finite axiomatizability criterion for this case.     

An Institution-independent Proof of Craig Interpolation Theorem

We formulate a general institution-independent (i.e. independent of the details of the actual logic formalised as institution) version of the Craig Interpolation Theorem and prove it in dependence of Birkhoff-style axiomatizability properties of the actual logic.We formalise Birkhoff-style axiomatizability within the general abstract model theoretic framework of institution theory by the novel concept of Birkhoff institution.Our proof destills a set of conditons behind the Craig Interpolation Property, which are easy to establish in the applications. Together with the generality of our approach, this leads to a wide range of applications for our result, including conventional and non-conventional logics (many of them from algebraic specification theory), such as general algebra, classical model theory, partial algebra, rewriting logic, membership algebra, etc. all of them in various versions and with various types of sentences (including infinitary ones). In dependence of axiomatizability properties many other applications are expected for various institutions or logics.     

A Note on Algebras of Substitutions

We will study the class RSA of -dimensional representable substitution algebras. RSA is a sub-reduct of the class of representable cylindric: algebras, and it was an open problem in Andréka [1] that whether RSA can be finitely axiomatized. We will show, that the answer is positive. More concretely, we will prove, that RSA is a finitely axiomatizable quasi-variety. The generated variety is also described. We note that RSA is the algebraic counterpart of a certain proportional multimodal logic and it is related to a natural fragment of first order logic, as well.     

On Reduction Systems Equivalent to The Lambek Calculus with the Empty String

The paper continues a series of results on cut-rule axiomatizability of the Lambek calculus. It provides a complete solution of a problem which was solved partially in one of the author's earlier papers. It is proved that the product-free Lambek Calculus with the empty string (L ₀) is not finitely axiomatizable if the only rule of inference admitted is Lambek's cut rule. The proof makes use of the (infinitely) cut-rule axiomatized calculus C designed by the author exactly for this purpose.     

Social cognition in simple action coordination: A case for direct perception

In this paper we sketch the outlines of an account of the kind of social cognition involved in simple action coordination that is based on direct social perception (DSP) rather than recursive mindreading. While we recognize the viability of a mindreading-based account such as e.g. Michael Tomasello’s, we present an alternative DSP account that (i) explains simple action coordination in a less cognitively demanding manner, (ii) is better able to explain flexibility and strategy-switching in coordination and crucially (iii) allows for formal modeling. This account of action coordination is based on the notion of an agent’s field of affordances. Coordination ensues, we argue, when, given a shared intention, the actions of and/or affordances for one agent shape the field of affordances for another agent. This a form of social perception since in particular perceiving affordances for another person involves seeing that person as an agent. It is a form of social perception since it involves perceiving affordances for another person and registering how another person’s actions influence one’s own perceived field of affordances.