Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

Computer Sciences

Institution
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 4441 - 4446 of 4446

Full-Text Articles in Entire DC Network

Mathematics As Rhyme, Vern Poythress Jun 1981

Mathematics As Rhyme, Vern Poythress

ACMS Conference Proceedings 1981

Using the analogy between the universe and a choral poem, one may view mathematics as the “rhyme” of the universe. In that perspective new light is thrown on the unique subject matter of mathematics, the a priori character of its truths, and the relation of mathematics to other areas of knowledge. A route is thereby opened for richer use of creativity in mathematics.


Science As Allegory, Vern Poythress Jun 1981

Science As Allegory, Vern Poythress

ACMS Conference Proceedings 1981

The universe is God’s choral poem, and science is a system of allegories within it. That is the thesis that I propose to expound and defend. Yet it is not a “thesis” at all, if the word “thesis” commits me to a certain kind of strict logical defense. I am not putting forward my thesis that science is allegory as the endpoint of a deductive or inductive argument. Rather, it is a springboard for a program of exploration and reflection that turns upside-down some conventional ways of thinking about science.


A Proof Procedure For Quantifier-Free Non-Clausal First Order Logic, Neil V. Murray Feb 1979

A Proof Procedure For Quantifier-Free Non-Clausal First Order Logic, Neil V. Murray

Electrical Engineering and Computer Science - Technical Reports

A proof procedure is described which operates on formulas of the predicate calculus which are quantifier-free. The procedure, which involves a single inference rule called NC-resolution, is shown to be complete. Completeness is also obtained for a simple restriction on the rule’s application. Examples are given using NC-resolution not only for synthesis of a logic program from its specification, but for execution of a program specification in its original form.


Fuzziness And Catastrophe, Martin Zwick, Daniel Guy Schwartz, George G. Lendaris Nov 1978

Fuzziness And Catastrophe, Martin Zwick, Daniel Guy Schwartz, George G. Lendaris

Complex Systems Faculty Publications and Presentations

In a recent short note, Flondor has alluded to a possible linkage of fuzzy set theory and catastrophe theory. We consider several features of catastrophe theory, namely the properties of discontinuous jumps, hysteresis, and divergence in the "cusp catastrophe," and the role of the bias factor in the "butterfly catastrophe," which have affinities to and suggest possible extensions of fuzzy set ideas. Certain functions extensively considered in catastrophe theory lend themselves in some cases to interpretation as membership functions. The use of such functions may be of interest for the characterization of linguistic descriptions which are time-varying and encompass both …


On The Benefactive Feature In Transitivity, Dale Ellen Gaucas Dec 1974

On The Benefactive Feature In Transitivity, Dale Ellen Gaucas

Electrical Engineering and Computer Science - Technical Reports

An elaboration on the transitivity system network introduced by M. A. K. Halliday is developed. This extension consists of a separate feature system network for the participant role of “beneficiary”. The formulation of the proposed grammar rules to conjoin this network and Halliday's is facilitated by building up the transitivity network to describe "systemically” and uniquely each type of benefactive and range clause presented by Halliday. Systemic descriptions of these clauses are given as examples throughout the discussion.


Studies In Computational Linguistics No. 1, The Recognition Of Alphabets, Edward F. Storm May 1970

Studies In Computational Linguistics No. 1, The Recognition Of Alphabets, Edward F. Storm

Electrical Engineering and Computer Science - Technical Reports

Formal parsing rules for programming languages often have machinery for recognizing identifiers, numerical constants, and other substrings whose internal structure is only marginally relevant to the language structure as a whole. In this note alphabets are introduced in which identifiers, constants, etc. are regarded as single symbols. An alphabet is thus constructed out of a finite set of characters, is identified as a regular language and a simple recognition algorithm is described, giving the language designer considerable latitude in his choice of alphabet.