Search results

• Turing Award
  ...is fifteen years of publications extend from theoretical articles on graph theory to basic manuals, expository texts, and philosophical contemplations in the ...ng to found the following important subfields of [[computer science]]: the theory of [[parsing]], the [[semantics]] of programming languages, automatic [[pro
  11 KB (1,508 words) - 10:52, 2 November 2006
• Ordinal number
  ...[[infinite]] sequences and to classify sets with certain kinds of [[order theory|order]] structures on them. Ordinals are an extension of the [[natural num ...hat each step is followed by a "lower" step, then you can be sure that the computation will terminate.
  29 KB (4,819 words) - 16:23, 9 January 2007
• Directory:Jon Awbrey/Papers/Differential Propositional Calculus
  =====Computation of &epsilon;''f''₈===== |+ style="height:30px" | <math>\text{Table F8.1} ~~ \text{Computation of}~ \boldsymbol\varepsilon f_{8}~\!</math>
  158 KB (22,468 words) - 03:24, 27 December 2016
• Directory:Jon Awbrey/Papers/Inquiry Driven Systems
  =====Inquiry and Computation===== ===Basic Notions of Group Theory===
  15 KB (1,597 words) - 12:00, 15 April 2017
• Relation theory
  ...quite naturally in applications. This approach to relation theory, or the theory of relations, is distinguished from, though closely related to, its study f ...., &ldquo;On the Theory of Relational Structures and Schemata for Parallel Computation&rdquo;, pp. 477&ndash;508 in A.R. Bednarek and Françoise Ulam (eds.), ''An
  25 KB (3,665 words) - 21:04, 16 November 2015
• Truth table
  A '''truth table''' is a tabular array that illustrates the computation of a ''logical function'', that is, a function of the form <math>f : \mathb * [[Relation theory]]
  16 KB (2,190 words) - 03:25, 30 October 2015
• Propositional calculus
  ...he corresponding families of text structures. The exigencies of practical computation on formal languages frequently demand that text strings be converted into p * Chang, C.C., and Keisler, H.J. (1973), ''Model Theory'', North-Holland, Amsterdam, Netherlands.
  17 KB (2,301 words) - 15:56, 7 November 2015
• Directory:Jon Awbrey/Papers/Differential Analytic Turing Automata
  ...cause it uses a species of graphs that are usually called "cacti" in graph theory. The last exposition of the cactus syntax that I've written can be found h I will draw on those previously advertised resources of notation and theory as needed, but right now I sense the need for some concrete examples.
  134 KB (16,535 words) - 15:30, 11 October 2013
• Relation (mathematics)
  ...ion itself is a mathematical object, defined in terms of concepts from set theory, that carries all the information from the Table in one neat package. ...icate''.&nbsp; From the more abstract viewpoints of formal logic and model theory, the relation <math>L\!</math> is seen as constituting a ''logical model''
  20 KB (2,925 words) - 17:08, 14 November 2015
• Relation composition
  ...rdquo; approach to relations that is outlined in the article on [[relation theory]]. ...ms, in set theories of various kinds, and through a broadening of category theory from functions to relations in general.
  65 KB (6,802 words) - 18:14, 14 November 2015
• Truth theory
  ...d developed by means of definite rules of inference. The scope of a truth theory can be restricted to tightly-controlled and well-bounded universes of disco ...the heading of ''semantics'', especially ''formal semantics'' and ''model theory''. Another association of longstanding interest is the relation between tr
  37 KB (5,460 words) - 14:45, 17 November 2015
• User:Jon Awbrey/BIB
  * [[John Dewey|Dewey, John]] (1938), ''Logic: The Theory of Inquiry'', Henry Holt and Company, New York, NY, 1938. Reprinted, pp. 1 * Dewey, John (1932), ''Theory of the Moral Life'', Part 2 of John Dewey and [[James H. Tufts]], ''Ethics'
  61 KB (7,563 words) - 18:26, 15 June 2010
• Directory:Jon Awbrey/BIB
  * [[John Dewey|Dewey, John]] (1938), ''Logic: The Theory of Inquiry'', Henry Holt and Company, New York, NY, 1938. Reprinted, pp. 1 * Dewey, John (1932), ''Theory of the Moral Life'', Part 2 of John Dewey and [[James H. Tufts]], ''Ethics'
  61 KB (7,562 words) - 18:18, 18 March 2008
• User:Roygbiv/Graph
  A '''logical graph''' is a [[graph theory|graph-theoretic]] structure in one of the systems of graphical [[syntax]] t :* Another reason is that it allows us to study a simple form of [[computation]] that is recognizable as a species of ''[[semiosis]]'', or sign-transformi
  42 KB (5,905 words) - 21:49, 22 May 2010
• Directory:Jon Awbrey/THEORY
  =Truth Theory (23 Jun 2006)= ...ped by means of definite ''[[rules of inference]]''. The scope of a truth theory can be restricted to tightly-controlled and well-bounded universes of disco
  81 KB (11,851 words) - 22:22, 25 January 2008
• User:Jon Awbrey/THEORY
  =Truth Theory (23 Jun 2006)= ...ped by means of definite ''[[rules of inference]]''. The scope of a truth theory can be restricted to tightly-controlled and well-bounded universes of disco
  81 KB (11,851 words) - 18:53, 20 August 2007
• Computer software
  ...invented by [[Charles Babbage]] as part of his [[difference engine]]. The theory that is the basis for most modern software was first proposed by [[Alan Tur ...rry out an operation -- moving [[data (computing)|data]], carrying out a [[computation]], or altering the [[control flow]] of instructions.
  14 KB (2,076 words) - 13:33, 31 October 2012
• Logical graph
  :* Another reason is that it allows us to study a simple form of computation that is recognizable as a species of ''[[semiosis]]'', or sign-transforming ...putation process. Simple as it is, this exhibits the main features of any computation, namely, a semiotic process that proceeds from an obscure sign to a clear s
  41 KB (5,845 words) - 14:26, 6 November 2015
• Introduction to Inquiry Driven Systems
  80 bytes (10 words) - 11:56, 6 October 2010
• Directory:Jon Awbrey/Papers/Inquiry Driven Systems : Part 4
  ...ken, forward course by following steps that are never unsure. Acquiring a theory of inquiry is not, in short, a purely deductive exercise. ...o positive proof can arise from so negative a recommendation. Acquiring a theory of inquiry is not, in sum, a purely inductive exercise.
  92 KB (15,197 words) - 14:40, 24 August 2017

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)