Search results

• Ordinal number
  ...dentify the α-th member of that class, i.e. one can index (count) them. A class is closed and unbounded if its indexing function is continuous and never st ...entical, and to seek a "canonical" representative of the isomorphism type (class). This is exactly what the ordinals provide, and it also provides a canoni
  29 KB (4,819 words) - 16:23, 9 January 2007
• Directory:Manhattan Elite Prep GRE
  ...>>http://www.manhattaneliteprep.com/gre-manhattan-new-york-nyc-prep-course-class-nyc/)<br> Atlanta (>>http://www.manhattaneliteprep.com/gre-atlanta-prep-course-class/)<br>
  5 KB (732 words) - 22:29, 22 December 2014
• Sign relation
  ...makes it convenient to lump signs and interpretants together into a single class called the ''syntactic domain''. In the forthcoming examples <math>S\!</ma ==Semiotic equivalence relations==
  58 KB (8,260 words) - 03:40, 21 November 2016
• Directory:Jon Awbrey/Papers/Syntactic Transformations
  <div class="nonumtoc">__TOC__</div> ...s use, namely, the conditions of the definition that lead up to the stated equivalence. The relevant STR is recorded in Rule&nbsp;1. By way of convention, I lis
  129 KB (17,728 words) - 22:14, 9 December 2015
• Directory:Jon Awbrey/Papers/Propositions As Types
  ...'nodes'' or ''vertices'') and two mappings from the class of arrows to the class of objects, called ''source'' and ''target'' (often also ''domain'' and ''c ...n interesting categories from deductive systems by imposing an appropriate equivalence relation on proofs.</p>
  150 KB (9,422 words) - 23:54, 6 July 2013
• Directory:Jon Awbrey/Papers/Theme One Program : Exposition
  The first order of business is to describe the general class of The logical class of cacti is the broadest, encompassing the whole species
  94 KB (8,938 words) - 22:12, 9 December 2015
• Boolean algebras canonically defined
  ...simply the models of the equational theory of two values, and observes the equivalence of both the lattice and ring definitions to this more elementary one.'' ...ties can be stated as, every class of models of the equational theory of a class ''C'' of algebras is the Homomorphic image of a Subalgebra of a direct Prod
  46 KB (7,114 words) - 18:24, 2 October 2007
• User:Jon Awbrey/ARCHIVE
  {| class="messagebox" align="center" border="0" style="background:deepskyblue; color | align="right" | 5 || [[Equivalence relation]]
  39 KB (4,682 words) - 14:55, 21 May 2007
• Directory:Jon Awbrey/Papers/Differential Analytic Turing Automata
  ...ask ahead is to chart a course from general ideas about ''transformational equivalence classes of graphs'' to a notion of ''differential analytic turing automata' ...transformation rules partitions the set of graphs into ''transformational equivalence classes'' (TECs).
  134 KB (16,535 words) - 15:30, 11 October 2013
• Directory:Jon Awbrey/Papers/Futures Of Logical Graphs
  ...Incidentally, though, it will also be convenient to take in the case of a class or collection of individuals with no pertinent inner structure as a trivial ...these may be treated as the canonical representatives of their respective equivalence classes.
  168 KB (21,027 words) - 12:41, 6 August 2017
• Directory:Jon Awbrey/Papers/Propositional Equation Reasoning Systems
  ...import, something that might be referred to as their ''logical equivalence class'' (LEC), and that we could as well call the ''constraint information'' or t ...o contemplate is how to characterize them as two species of a very general class.
  157 KB (17,761 words) - 03:44, 10 November 2016
• User:Roygbiv/Graph
  ...s eye view in question is more formally known as the perspective of formal equivalence, from which remove one cannot see many distinctions that appear momentous f ...induce its [[partition of a set|partition]] into exactly two [[equivalence class]]es, is what [[George Spencer Brown]] called the ''primary arithmetic''.
  42 KB (5,905 words) - 21:49, 22 May 2010
• Directory:Jon Awbrey/Papers/Cactus Language
  ...omputational representation, the expressions of this calculus parse into a class of tree-like data structures called ''painted cacti''. This is a family of ...e former class of data structures, leaving the consideration of the latter class to a part of the project where their distinctive features are key to develo
  211 KB (31,551 words) - 20:44, 2 August 2017
• Directory:Jon Awbrey/Papers/Inquiry Driven Systems : Part 3
  <div class="nonumtoc">__TOC__</div> ...as denoting either (1) a class of entities or (2) all of the members of a class of entities, depending on which interpretation the reader prefers. These t
  138 KB (23,322 words) - 14:50, 4 January 2015
• Directory:Jon Awbrey/Papers/Inquiry Driven Systems : Part 4
  <div class="nonumtoc">__TOC__</div> ...nd (2) to focus on special cases of pragmatic transformations in which one class of entities is fixed.
  92 KB (15,197 words) - 14:40, 24 August 2017
• Directory:Jon Awbrey/Papers/Functional Logic : Inquiry and Analogy
  <div class="nonumtoc">__TOC__</div> ...name{and}~ S^{\prime\prime\prime}\!</math> are taken at random from such a class that their characters at random are such as <math>{P^{\prime}, P^{\prime\pr
  106 KB (13,991 words) - 18:45, 18 March 2020
• Directory:Jon Awbrey/Essays/Inquiry Driven Systems : Fields Of Inquiry
  This section introduces the class of mathematical objects known as proposition fields. These are structures w ...purely superficial change, since the analytic expansion preserves logical equivalence with the original proposition, but the good of a particular form for a part
  150 KB (18,770 words) - 15:54, 26 December 2020
• Directory:Jon Awbrey/Papers/Information = Comprehension × Extension
  ...attributes and so connote them as to determine what they denote. To this class belong all ''words'' and all ''conceptions''. Most combinations of words a ...r. Since they have no common character which does not belong to the whole class of mammals, it is plain that ''mammals'' may be substituted for this term.
  362 KB (47,812 words) - 19:40, 9 November 2016
• User:Jon Awbrey/DIFF/B
  Let !X! = {x_1, ..., x_k} be a finite class of variables -- is commonly known as "logical equivalence",
  107 KB (9,168 words) - 14:23, 22 May 2007
• Directory:Jon Awbrey/Papers/Inquiry Driven Systems : Part 1
  <div class="nonumtoc">__TOC__</div> ...digm.''' Generic example that reflects significant properties of a target class of phenomena, often derived from a tradition of study.
  241 KB (38,416 words) - 15:14, 15 April 2017

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