The goal of this dissertation is to give a logical representation of the knowledge dynamics that takes place during communication. I present a number of di erent logical frameworks for a number of di erent scenarios, ranging from an email conversation where all information that is sent is considered to be true, to a game of Liar's Dice where lying is expected of the players. In Chapter 3, I present a framework for modeling the knowledge of agents who exchange messages, using Dynamic Epistemic Logic. This framework uses Kripke models to represent the agents' knowledge in a static situation, and action models to update these Kripke models when the situation changes. Because the models are supposed to be nite, and all messages are represented explicitly in the model, the messages that are considered possible by the agents are limited to a nite set. This framework is useful in a situation in which there is a number of rounds in each of which a nite set of new messages becomes available to the agents. These messages can gradually be added to the model. The framework presented in Chapter 4 is of a more general nature. It models a setting where agents communicate with messages over a speci fic network in accordance to a certain protocol. This framework is very exible because the nature of communicative events and the observational power of the agents can be adapted to the situation at hand. It combines properties of the Dynamic Epistemic Logic approach with the perspective of Interpreted Systems. In Chapter 5 and 6 I focus on email communication speci cally. I rst study the existence of common knowledge in a group of agents who communicate via emails. Unlike the approach presented in Chapter 3, all possible emails are rep- resented in the model, which is therefore of in nite size. I prove a number of properties of nite states in this in nite model, and show that common knowledge of an email with BCC recipients is rare. Apart from common knowledge, I consider two new kinds of knowledge: potential and de nitive knowledge. These two types of knowledge make a distinction between the assumption that every agent immediately reads every email he receives, or that every agent has only read the emails he replied to or forwarded. I also present a method to do model checking, even though the model is of in nite size. Chapter 7 is a study of the properties of action models, which are used to model communicative events. I de ne a notion of action emulation that signi es when two canonical action models are equivalent. Because every action model has an equivalent canonical action model which can be computed, this gives a general method to determine action model equivalence. In Chapter 8 I move from knowledge to belief. I use the same Kripke models as for knowledge, only without the assumption that all relations are equivalence relations. I propose a di erent assumption, namely that the relations are linked. I also give a number of updates of these models that preserve this property, representing communicative events. Finally, Chapter 9 gives di erent perspectives on the issue of lying. It includes a complete logic of manipulative updating, which can be used to represent the e ects of lying in a group of agents. I also analyze a game of Liar's Dice and implement this scenario in the model checker DEMO. Furthermore, I show that in a game where lying is considered normal, a lie is no longer a lie: because the agents who hear the lie do not believe it, no false belief is created.

Current-controlled logic and single electron logic processors have been investigated with respect to thermal-induced bit error. A maximal error rate for both logic processors is regarded as one bit-error/year/chip. A maximal clock frequency and an information channel capacity at a given operation current are derived when a current-controlled logic processor works without error. An available operation range in a current-controlled processor with 100 million elements is discussed. The dependence of an error-free condition on temperature in single electron logic processors is derived. The size of the quantum dot of single electron transistor is predicted when a single electron logic processor with the a billion single electron transistors works without error at room temperature.

Thesis (Ph. D.)--University of Texas at Austin, 2001. / Vita. Includes bibliographical references (leaves 99-104). Available also in a digital version from Dissertation Abstracts.

published_or_final_version / Electrical and Electronic Engineering / Doctoral / Doctor of Philosophy

There is an interesting connection between cardinality of language and the distinction of lingua characterica from calculus rationator. Calculus-type languages have only a countable number of sentences, and only a single semantic valuation per sentence. By contrast, some of the sentences, and only a single semantic valuation per sentence. By contrast, some of the sentences of a lingua have available an uncountable number of semantic valuations. Thus, the lingua-type of language appears to have a greater degree of semantic universality than that of a calculus. It is suggested that the present notion of lingua provides a platform for a theory of ambiguity, whereby single sentences may have multiply - indeed, uncountably - many semantic valuations. It is further suggested that this might lead to a pacification of paradox. This thesis involves Peter Aczel's notion of a universal syntax, Russell's question, Keith Simmons' theory of diagonal argument, Curry's paradox, and a 'Leibnizian' notion of language. / vii, 111 leaves ; 29 cm.

No description available.

No description available.

A logical framework and its implementation should serve as a flexible tool for specifying, simulating, and reasoning about formal systems. When the formal systems we are interested in exhibit state and concurrency, however, existing logical frameworks fall short of this goal. Logical frameworks based on a rewriting interpretation of substructural logics, ordered and linear logic in particular, can help. To this end, this dissertation introduces and demonstrates four methodologies for developing and using substructural logical frameworks for specifying and reasoning about stateful and concurrent systems. Structural focalization is a synthesis of ideas from Andreoli’s focused sequent calculi and Watkins’s hereditary substitution. We can use structural focalization to take a logic and define a restricted form of derivations, the focused derivations, that form the basis of a logical framework. We apply this methodology to define SLS, a logical framework for substructural logical specifications, as a fragment of ordered linear lax logic. Logical correspondence is a methodology for relating and inter-deriving different styles of programming language specification in SLS. The styles we connect range from very high-level specification styles like natural semantics, which do not fully specify the control structure of programs, to low-level specification styles like destination-passing, which provide detailed control over concurrency and control flow. We apply this methodology to systematically synthesize a low-level destination-passing semantics for a Mini-ML language extended with stateful and concurrent primitives. The specification is mostly high-level except for the relatively few rules that actually deal with concurrency. Linear logical approximation is a methodology for deriving program analyses by performing abstract analysis on the SLS encoding of the language’s operational semantics. We demonstrate this methodology by deriving a control flow analysis and an alias analysis from suitable programming language specifications. Generative invariants are a powerful generalization of both context-free grammars and LF’s regular worlds that allow us to express invariants of SLS specifications in SLS.We show that generative invariants can form the basis of progress-andpreservation- style reasoning about programming languages encoded in SLS.

Complex fuzzy logic is a new type of multi-valued logic, in which truth values are drawn from the unit disc of the complex plane; it is thus a generalization of the familiar infinite-valued fuzzy logic. At the present time, all published research on complex fuzzy logic is theoretical in nature, with no practical applications demonstrated. The utility of complex fuzzy logic is thus still very debatable. In this thesis, the performance of ANCFIS is evaluated. ANCFIS is the first machine learning architecture to fully implement the ideas of complex fuzzy logic, and was designed to solve the important machine-learning problem of time-series forecasting. We then explore extensions to the ANCFIS architecture. The basic ANCFIS system uses batch (offline) learning, and was restricted to univariate time series prediction. We have developed both an online version of the univariate ANCFIS system, and a multivariate extension to the batch ANCFIS system. / Software Engineering and Intelligent Systems

Typescript. / Thesis (Ph. D.)--University of Hawaii at Manoa, 1990. / Includes bibliographical references (leaves 290-303) / Microfiche. / xvii, 303 leaves, bound 29 cm