Search results

• Relation reduction
  ...nal base'', each of which is properly simpler in a specified way than the relation under examination. ...eduction or relational reducibility is sometimes posed as a question of '''relation reconstruction''' or '''relational reconstructibility''', since a useful wa
  29 KB (4,035 words) - 03:32, 15 November 2015
• Relation theory
  ...ns, many of which arise quite naturally in applications. This approach to relation theory, or the theory of relations, is distinguished from, though closely r Two definitions of the relation concept are common in the literature. Although it is usually clear in cont
  25 KB (3,665 words) - 21:04, 16 November 2015
• Pragmatic Semiotic Information
  ...codifying a special type of uncertainty as to ''what regulative principle has any chance of success'', but the chief uncertainty is that we are called on ...ing present, serves to reduce the uncertainty of a decision that the agent has to make, whether it concerns the actions that the agent ought to take in or
  20 KB (2,552 words) - 15:16, 2 March 2024
• Semiotic Information
  ...codifying a special type of uncertainty as to ''what regulative principle has any chance of success'', but the chief uncertainty is that we are called on ...ing present, serves to reduce the uncertainty of a decision that the agent has to make, whether it concerns the actions that the agent ought to take in or
  20 KB (2,557 words) - 15:36, 5 November 2020
• Directory:Jon Awbrey/Papers/Semiotic Information
  ...codifying a special type of uncertainty as to ''what regulative principle has any chance of success'', but the chief uncertainty is that we are called on ...ing present, serves to reduce the uncertainty of a decision that the agent has to make, whether it concerns the actions that the agent ought to take in or
  20 KB (2,560 words) - 14:10, 29 October 2016
• Correspondence theory of truth
  ...most commonly cited problem for the correspondence theory is defining the relation of correspondence, and ''when'' a proposition corresponds with the facts.&n ...there must ''exist'' some fact to which it corresponds: the proposition P has to correspond with the fact that P, if the proposition P is true. So, we ca
  10 KB (1,514 words) - 17:42, 27 March 2017
• Propositional calculus
  ...these expressions, plus a set of transformation rules that define a binary relation on the space of expressions. ...rules are typically intended to preserve some type of semantic equivalence relation among the expressions. In particular, when the expressions are interpreted
  17 KB (2,301 words) - 15:56, 7 November 2015
• Minimal negation operator
  ...\mathrm{false}~\!</math> and <math>1 = \mathrm{true}.~\!</math>&nbsp; This has the following consequences: ...on of <math>x~\!</math> and <math>y,~\!</math> while its fiber of 1 is the relation of inequality between <math>x~\!</math> and <math>y.~\!</math>
  23 KB (3,337 words) - 13:54, 3 September 2017
• Dynamics of inquiry
  ...ave something to do with the dynamics of inquiry. This broad subject area has a part that is given by nature and a part that is ruled by nurture. On fi ...ils of thought that led him to develop a ''[[theory of signs]]'', one that has come to be known as '[[semiotic]]', and tracking next the ways of thinking
  24 KB (3,783 words) - 00:25, 16 November 2015
• Relation composition
  ...ly typed&rdquo; approach to relations that is outlined in the article on [[relation theory]]. The first order of business is to define the operation on [[relation (mathematics)|relations]] that is variously known as the ''composition of r
  65 KB (6,802 words) - 18:14, 14 November 2015
• Directory:Jon Awbrey/MathJax Problems
  ...ropositional form <math>x \Rightarrow y\!</math> is equivalent to an order relation <math>x \le y\!</math> on the boolean values <math>0, 1 \in \mathbb{B},\!</ ...im &mdash; conveys more information &mdash; than the claim that the 2-adic relation <math>p \le r\!</math> holds between the two propositions <math>p\!</math>
  59 KB (5,442 words) - 19:40, 8 November 2016
• Sign relation
  A '''sign relation''' is the basic construct in the theory of signs, also known as [[semeiotic In his picturesque illustration of a sign relation, along with his tracing of a corresponding sign process, or ''[[semiosis]]'
  58 KB (8,260 words) - 03:40, 21 November 2016
• Directory:Jon Awbrey/SANDBOX
  meaning that every Boolean algebra, however small or large, has two constants or "nullary" operations, four unary operations, 16 binary ope meaning that every Boolean algebra, however small or large, has two constants or "nullary" operations, four unary operations, 16 binary ope
  46 KB (7,067 words) - 04:10, 22 May 2010
• Computer software
  ...f machine [[machine code|instructions]]. Some software, however, is of a [[relation (mathematics)|relational]] form which translates into being the [[graph (ma ...piling, interpreter, debugging, tracing, and etc., because the IDE usually has an advanced ''graphical user interface,'' or GUI.
  14 KB (2,076 words) - 13:33, 31 October 2012
• Truth theory
  ...and ''model theory''. Another association of longstanding interest is the relation between truth and ''logical validity'', "because the fundamental notion of ...d strategy for approaching their complexity is to consider the [[two-place relation]]s that are left when the presence of a selected domain is simply ignored.
  37 KB (5,460 words) - 14:45, 17 November 2015
• Directory:Jon Awbrey/Papers/Syntactic Transformations
  ...left Q \upharpoonright (x) = \underline{1}</math> in any context where one has a relatively fixed <math>Q \subseteq X</math> in mind and where one is conc ...By the time one arrives in the "consequence box" of either Rule, then, one has in mind a comparatively fixed <math>Q \subseteq X,</math> a proposition <ma
  129 KB (17,728 words) - 22:14, 9 December 2015
• Directory:Jon Awbrey/Papers/Dynamics And Logic
  ...be taken as a boolean function <math>f(p, q)\!</math> having the abstract type <math>f : \mathbb{B} \times \mathbb{B} \to \mathbb{B},</math> where <math>\ ...bb{B},</math> plus and minus are identical operations. This will make the relation between the differential and the integral parts of the appropriate calculus
  127 KB (18,875 words) - 13:28, 10 December 2014
• Inquiry
  ...ount of the various types of inquiry and a treatment of the ways that each type of inquiry achieves its aim. <p>Induction, or inductive reasoning, consists in establishing a relation between one extreme term and the middle term by means of the other extreme;
  58 KB (7,676 words) - 22:34, 15 November 2015
• Directory:Jon Awbrey/Papers/Differential Logic : Introduction
  ...be taken as a boolean function <math>f(p, q)\!</math> having the abstract type <math>f : \mathbb{B} \times \mathbb{B} \to \mathbb{B},\!</math> where <math ...{B},\!</math> plus and minus are identical operations. This will make the relation between the differential and the integral parts of the appropriate calculus
  131 KB (20,198 words) - 15:38, 2 December 2015
• Directory:Jon Awbrey/Papers/Theme One Program : Exposition
  a common data structure fundamental algorithms for one type of inductive learning and one type of deductive reasoning.
  94 KB (8,938 words) - 22:12, 9 December 2015

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