The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
We propose a minimal logic for interactive epistemology based on a qualitative representation of epistemic individual and group attitudes including knowledge, belief, strong belief, common knowledge and common belief. We show that our logic is sufficiently expressive to provide an epistemic foundation for various game-theoretic solution concepts including “1-round of deletion of weakly dominated strategies,...
Two agents endowed with different categorisations engage in bargaining to reach an understanding and agree on a common categorisation. We model the process as a simple non-cooperative game and demonstrate three results. When the initial disagreement is focused, the bargaining process has a zero-sum structure. When the disagreement is widespread, the zero-sum structure disappears and the unique equilibrium...
We introduce a new solution concept, called correlated-belief equilibrium. The difference to Nash equilibrium is that, while each player has correct marginal conjectures about each opponent, it is not necessarily the case that these marginal conjectures are independent. Then, we provide an epistemic foundation and we relate correlated-belief equilibrium with standard solution concepts, such as rationalizability,...
According to Ian Hacking’s Entity Realism, unobservable entities that scientists carefully manipulate to study other phenomena are real. Although Hacking presents his case in an intuitive, attractive, and persuasive way, his argument remains elusive. I present five possible readings of Hacking’s argument: a no-miracle argument, an indispensability argument, a transcendental argument, a Vichian argument,...
This paper compares two ‘relativist’ theories about deliciousness: truth-relativism, and Kit Fine’s non-factualism about a subject-matter. Contemporary truth-relativism is presented as a linguistic thesis; its metaphysical underpinning is often neglected. I distinguish three views about the obtaining of worldly states of affairs concerning deliciousness, and argue that none yields a satisfactory version...
Neo-Fregeans take their argument for arithmetical realism to depend on the availability of certain, so-called broadly syntactic tests for whether a given expression functions as a singular term. The broadly syntactic tests proposed in the neo-Fregean tradition are the so-called inferential test and the Aristotelian test. If these tests are to subserve the neo-Fregean argument, they must be at least...
Characterizing different kinds of representation is of fundamental importance to cognitive science, and one traditional way of doing so is in terms of the analog–digital distinction. Indeed the distinction is often appealed to in ways both narrow and broad. In this paper I argue that the analog–digital distinction does not apply to representational schemes but only to representational systems, where...
We show that various paradoxes can arise in a natural class of social networks. They demonstrate that more services or products may have adverse consequences for all members of the network and conversely that restricting the number of choices may be beneficial for every member of the network. These phenomena have been confirmed by a number of empirical studies. In our analysis we use a simple threshold...
The paper traces the development and the role of syntactic reduction in Edmund Husserl’s (1856–1938) early writings on mathematics and logic, especially on arithmetic. The notion has its origin in Hermann Hankel’s (1839–1873) principle of permanence that Husserl set out to clarify. In Husserl’s early texts the emphasis of the reductions was meant to guarantee the consistency of the extended algorithm...
This paper examines a case of failed interdisciplinary collaboration, between experimental stem cell research and theoretical systems biology. Recently, two groups of theoretical biologists have proposed dynamical systems models as a basis for understanding stem cells and their distinctive capacities. Experimental stem cell biologists, whose work focuses on manipulation of concrete cells, tissues...
We present Dynamic Epistemic Temporal Logic, a framework for reasoning about operations on multi-agent Kripke models that contain a designated temporal relation. These operations are natural extensions of the well-known “action models” from Dynamic Epistemic Logic (DEL). Our “temporal action models” may be used to define a number of informational actions that can modify the “objective” temporal structure...
As they are conventionally formulated, Boolean games assume that players make their choices in ignorance of the choices being made by other players – they are games of simultaneous moves. For many settings, this is clearly unrealistic. In this paper, we show how Boolean games can be enriched by dependency graphs which explicitly represent the informational dependencies between variables in a game...
It is sometimes the case that one solution concept in game theory is equivalent to applying another solution concept to a modified version of the game. In such cases, does it make sense to study the former separately (as it applies to the original representation of the game), or should we entirely subordinate it to the latter? The answer probably depends on the particular circumstances, and indeed...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.