Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Internal Acc...
Abstract We define a finitary model of firstorder Peano Arithmetic in which quantification is interpreted constructively in terms of Turingcomputability, and show that it is incons...
Abstract. Logics that involve collections (sets, multisets), and cardinality constraints are useful for reasoning about unbounded data structures and concurrent processes. To make ...
Abstract. Interact Intermediate supports goal-directed process modeling in such a way as to maximize the concurrency of activities and to minimize the direct control of humans in t...
Abstract The Ada language has been designed to support development of concurrent and distributed software. While the Ada83 standard defined the basic mechanisms of rendezvous-based...