In this paper an attempt is made to explore the logical founda-tions of computer programming by use of techniques which were first applied in the study of geometry and have later been extended to other branches of mathematics. This in-volves the elucidation of sets of axioms and rules of inference which can be used in proofs of the properties of computer programs. Examples are given of such axioms and rules, and a formal proof of a simple theorem is displayed. Finally, it is argued that important advantages, both theoretical and prac-tical, may follow from a pursuance of these topics.

present an axiomatic formulation of fundamental mechanisms in communication networks. In particular, we reconcile the existing but somewhat fuzzy concepts of naming and addressing and present a consistent set of primitives that are sufficient to compose communication services. The long-term goal

to stimuli from one or more environments effectively, without compromising the integrity of the system. This paper presents an axiomatic basis on which integrity constraints over concurrent interactive dynamics can be formally specified and resolved. Formalization of constraints help in automating the task

Abstract:We propose an intuitive understanding of the statement: ‘an axiom (or: an axiomatic basis) determines the meaning of the only specific constant occurring in it. ’ We introduce some basic semantics for functors

and plan recognition. The formal basis of the representation is presented in detail, from the axiomatization of time periods to the relationship between actions and events and their effects. The power of the representation is illustrated by applying it to the axiomatization and solution of several standard

Abstract. We present a new technique for studying the w-axiomatizability of the semantics in the ltbt-spectrum. Although Fokkink et al. have recently solved most of the problems still open, our main goal is to shed light on them, and to simply and unify their proofs. Besides, we will focus on preorders (and make a fundamental use of the axiom for ready simulation semantics) instead of equivalences, since they give rise to much simpler proofs. 1

only by the axiomatic basis and the theorems derived from it. We also show that the concept of (quasi)static process does not belong to the body of Thermostatics. pacs: 05.70, 01.70.+w

Although many investigators arm a desire to build reasoning systems that behave consistently with the axiomatic basis dened by probability theory and utility theory, limited resources for engineering and computation can make a complete normative anal-ysis impossible. We attempt to move discussion

A theory of decision making is proposed that supplies an axiomatic basis for the concept of “satisficing” postulated by Herbert Simon. After a detailed review of classical results that characterize several varieties of preference-maximizing choice behavior, the axiomatization proceeds by weakening

, based on a precise set of axioms. However, it is possible to develop the theory of set considerably without any knowledge of those axioms…The concept of a ‘set of objects ’ is a very intuitive one, and, with care, considerable, sound progress may be made on the basis of this intuition alone.”