Journal ArticleDOI
The foundations of the logic of N-tuples
Reads0
Chats0
TLDR
In this article, the authors pointed out the inadequacies of the standard mathematical approach to n- tuples, and developed an axiomatic base for linear dyadic structures (list structures).Abstract:
This paper (1) points out the inadequacies of the standard mathematical approach to n- tuples, (2) develops an axiomatic base for linear dyadic structures (list structures), (3) uses the axiomatic base to (a) prove a theorem which shows that the system requires an infinite model (Foundedness Theorem), (b) define n-tuples and (c) prove a theorem used in fast pattern matching (Fundamental N-tuple Theorem). Finally, (4) the system is shown to be consistent.read more
Citations
More filters
Book ChapterDOI
Intelligent control of a multiactuator system
TL;DR: In this article, the structure of an Intelligent Multiactuator System (IMS) with redundancies is discussed, where the choice between concurring alternatives appears at a definite stage as a regular procedure of system operation.
Journal ArticleDOI
Intelligent Control of a Multiactuator System
TL;DR: In this paper, the structure of an Intelligent Multiactuator System (IMS) with redundancies is discussed, where the choice between concurring alternatives appears at a definite stage as a regular procedure of system operation.
Journal ArticleDOI
A complete system generation algorithm for List structures
TL;DR: In this paper, a decision procedure for elementary list structures without recursion (List-S) is presented, and every sentence of List-S is shown to be a member of the decision procedure.
References
More filters
Journal ArticleDOI
Fast Pattern Matching in Strings
TL;DR: An algorithm is presented which finds all occurrences of one given string within another, in running time proportional to the sum of the lengths of the strings, showing that the set of concatenations of even palindromes, i.e., the language $\{\alpha \alpha ^R\}^*$, can be recognized in linear time.
Book
Introduction to Mathematical Logic
TL;DR: This long-established text continues to expose students to natural proofs and set-theoretic methods and offers enough material for either a one- or two-semester course on mathematical logic.
Book ChapterDOI
A Basis for a Mathematical Theory of Computation
TL;DR: The chapter explores what practical results can be expected from a suitable mathematical theory and presents several descriptive formalisms with a few examples of their use and theories that enable to prove the equivalence of computations expressed in these formalisms.