With agents relying more and more on information from central servers rather than their own sensors, knowledge becomes property not of a specific agent but of the data that the agents can access. The article proposes a dynamic logic of data-informed knowledge that describes an interplay between three modalities and one relation capturing the properties of this form of knowledge. The main technical results are the undefinability of two dynamic operators through each other, a sound and complete axiomatisation, and a (...) model checking algorithm. (shrink)

Two different types of functional dependencies are compared: dependencies that are functional due to the laws of nature and dependencies that are functional if all involved agents behave rationally. The first type of dependencies was axiomatized by Armstrong. This article gives a formal definition of the second type of functional dependencies in terms of strategic games and describes a sound and complete axiomatization of their properties. The axiomatization is significantly different from the Armstrong’s axioms.

The article studies knowledge in multiagent systems where data available to the agents may have small errors. To reason about such uncertain knowledge, a formal semantics is introduced in which indistinguishability relations, commonly used in the semantics for epistemic logic S5, are replaced with metrics to capture how much two epistemic worlds are different from an agent’s point of view. The main result is a logical system sound and complete with respect to the proposed semantics.

The classical propositional logic is known to be sound and complete with respect to the set semantics that interprets connectives as set operations. The paper extends propositional language by a new binary modality that corresponds to partial recursive function type constructor under the above interpretation. The cases of deterministic and non-deterministic functions are considered and for both of them semantically complete modal logics are described and decidability of these logics is established.

A new modal logic is introduced. It describes properties of provability by interpreting modality as a deductive closure operator on sets of formulas. Logic is proven to be decidable and complete with respect to this semantics.

A relation between two secrets, known in the literature as nondeducibility , was originally introduced by Sutherland. We extend it to a relation between sets of secrets that we call independence . This paper proposes a formal logical system for the independence relation, proves the completeness of the system with respect to a semantics of secrets, and shows that all axioms of the system are logically independent.

Three different types of interdependence between pieces of information, or "secrets", are discussed and compared. Two of them, functional dependence and non-deducibility, have been studied and axiomatized before. This article introduces a third type of interdependence and provides a complete and decidable axiomatization of this new relation.

Traditionally, the formulae in modal logic express properties of possible worlds. Prior introduced “egocentric” logics that capture properties of agents rather than of possible worlds. In such a setting, the article proposes the modality “know how to tell apart” and gives a complete logical system describing the interplay between this modality and the knowledge modality. An important contribution of this work is a new matrix-based technique for proving completeness theorems in an egocentric setting.

The article studies properties of interchangeability of pure, mixed, strict, and strict mixed Nash equilibria. The main result is a sound and complete axiomatic system that describes properties of interchangeability in all four settings. It has been previously shown that the same axiomatic system also describes properties of independence in probability theory, nondeducibility in information flow, and non-interference in concurrency theory.

A new approach to defining complexity of propositional formulas and proofs is suggested. Instead of measuring the size of these syntactical structures in the propositional language, the article suggests to define the complexity by the size of external descriptions of such constructions. The main result is a lower bound on proof complexity with respect to this new definition of complexity.

The paper considers a commonly used axiomatization of the classical propositional logic and studies how different axiom schemata in this system contribute to proof complexity of the logic. The existence of a polynomial bound on proof complexity of every statement provable in this logic is a well-known open question.The axiomatization consists of three schemata. We show that any statement provable using unrestricted number of axioms from the first of the three schemata and polynomially-bounded in size set of axioms from the (...) other schemata, has a polynomially-bounded proof complexity. In addition, it is also established, that any statement, provable using unrestricted number of axioms from the remaining two schemata and polynomially-bounded in size set of axioms from the first scheme, also has a polynomially-bounded proof complexity. (shrink)

The article proposes Logic of Secrets in Collaboration Networks, a formal logical system for reasoning about a set of secrets established over a fixed configuration of communication channels. The system’s key feature, a multi-channel relation called independence, is a generalization of a two-channel relation known in the literature as nondeducibility. The main result is the completeness of the proposed system with respect to a semantics of secrets.

The article studies properties of functional dependencies between strategies of players in Nash equilibria of multiplayer strategic games. The main focus is on the properties of functional dependencies in the context of a fixed dependency graph for payoff functions. A logical system describing properties of functional dependence for any given graph is proposed and is proven to be complete.

The article studies preferences of agents in a setting with imperfect information. For such a setting, the authors propose a new class of preferences. It is said that an agent prefers one statement over another if, among all indistinguishable worlds, the agent prefers the worlds where the first statement is true to those where the second one is true. The main technical result is a sound and complete logical system describing the interplay between a binary modality capturing preferences and the (...) knowledge modality. The proof of completeness is using a newly proposed “tumbled pairs” technique. (shrink)

The article proposes a formal semantics of happiness and sadness modalities in the imperfect information setting. It shows that these modalities are not definable through each other and gives a sound and complete axiomatization of their properties.

The article investigates information flow properties of symmetric multi-party protocols. It gives a sound and complete axiomatic system for properties of the functional dependence predicate that are common to all protocols with the same group of symmetries.

The article studies common knowledge in communication networks with a fixed topological structure. It introduces a non-trivial principle, called the Ryōan-ji axiom, which captures logical properties of common knowledge of all protocols with a given network topology. A logical system, consisting of the Ryōan-ji axiom and two additional axioms, is proven to be sound and complete.

Diffusion in social networks is a result of agents’ natural desires to conform to the behavioral patterns of their peers. In this article we show that the recently proposed “propositional opinion diffusion model” could be used to model an agent’s conformity to different social groups that the same agent might belong to, rather than conformity to the society as whole. The main technical contribution of this article is a sound and complete logical system describing the properties of the influence relation (...) in this model. The logical system is an extension of Armstrong’s axioms from database theory by one new axiom that captures the topological structure of the network. (shrink)

Betweenness as a relation between three individual points has been widely studied in geometry and axiomatized by several authors in different contexts. The article proposes a more general notion of betweenness as a relation between three sets of points. The main technical result is a sound and complete logical system describing universal properties of this relation between sets of vertices of a graph.

The article proposes Logic of Secrets in Collaboration Networks, a formal logical system for reasoning about a set of secrets established over a fixed configuration of communication channels. The system’s key feature, a multi-channel relation called independence, is a generalization of a two-channel relation known in the literature as nondeducibility. The main result is the completeness of the proposed system with respect to a semantics of secrets.

Libertarian philosophy asserts that only the initiation of physical force against persons or property, or the threat thereof, is inherently illegitimate. A corollary to this assertion is that all forms of speech, including fraudulent advertising, are not invasive and therefore should be considered legitimate. On the other hand, fraudulent advertising can be viewed as implicit theft under the theory of contract: if a seller accepts money knowing that his product does not have some of its advertised characteristics, he acquires the (...) property title to the customer’s money without voluntary consent, which is theft. The balance between these two logical extensions of property rights—the right of free speech and the right of contract—lies somewhere in the area of communication philosophy, and can be explained through understanding the role of communication in human interactions. Advertising is a form of communication that may convey important information about the conditions of the proposed contract. These conditions are expressed in particular words that may have different meanings in different circumstances. Therefore to determine whether a particular example or “misinterpretation” is mere sophistry or a type of fraud, the judicial system has to approach each issue on a case-by-case basis. The border between legal and illegal should be determined by precedents and by expectations based on commonly accepted definitions of terms—what people commonly understand by the words and other forms of communication they use. (shrink)

Out of the broad variety of Cusanus' work, this book discusses six of his writings, careful not to isolate them from the whole of his work. It instead presents them against the maturation of Cusanus' thinking as it developed from his first sermons up to his shortest philosophical text De apice theoriae. The texts in question are De docta ignorantia, De coniecturis, Idiota de mente, De beryllo, Trialogus de possest and De apice theoriae. In the search for God, or rather (...) in Cusanus' lifetime eff orts to have his spirit touch the fi rst principle and the basis of all things, new perspectives on the world and man within would open up for Cusanus. Respecting this basic intention of Cusanus' thinking, the author primarily deals with Cusanus' ontotheological (metaphysical) claims and, in their context, turns his attention to the cosmological, or anthropologico-gnoseological opinions. (shrink)

In my comment on Katerina Ierodiakonou’s paper, I outline my understanding of the programme of De anima and how it bears on Aristotle’s discussion of the transparent in De anima 2.7, in contrast with his discussion of the transparent in De sensu 3. I then explore Aristotle’s notion of transparency and sketch an alternative to Ierodiakonou’s interpretation of Aristotle’s views as to how colours are generated in physical objects. At the end, I raise two objections to Alexander’s interpretation of the (...) transparent as discussed by Ierodiakonou. (shrink)

Chapter One: Constructions. Entities, constructions, and functions When one travels from Los Angeles to New York, going, say, by way of St. Louis, Chicago, ...

Traxler, Pickering, and Clifton found that ambiguous sentences are read faster than their unambiguous counterparts. This so-called ambiguity advantage has presented a major challenge to classical theories of human sentence comprehension because its most prominent explanation, in the form of the unrestricted race model, assumes that parsing is non-deterministic. Recently, Swets, Desmet, Clifton, and Ferreira have challenged the URM. They argue that readers strategically underspecify the representation of ambiguous sentences to save time, unless disambiguation is required by task demands. When (...) disambiguation is required, however, readers assign sentences full structure—and Swets et al. provide experimental evidence to this end. On the basis of their findings, they argue against the URM and in favor of a model of task-dependent sentence comprehension. We show through simulations that the Swets et al. data do not constitute evidence for task-dependent parsing because they can be explained by the URM. However, we provide decisive evidence from a German self-paced reading study consistent with Swets et al.'s general claim about task-dependent parsing. Specifically, we show that under certain conditions, ambiguous sentences can be read more slowly than their unambiguous counterparts, suggesting that the parser may create several parses, when required. Finally, we present the first quantitative model of task-driven disambiguation that subsumes the URM, and we show that it can explain both Swets et al.'s results and our findings. (shrink)