Search results

• Logic Syllabus
  ===Logical operators=== * [[Logical conjunction]]
  3 KB (346 words) - 18:30, 27 May 2020
• Universe of discourse
  ** [http://www.helsinki.fi/science/commens/terms/logicaluniv.html Logical Universe] ===Logical operators===
  6 KB (702 words) - 19:14, 7 November 2015
• Directory:Jon Awbrey/Projects/Theme One Program
  [[Category:Logical Graphs]] [[Category:Logical Modeling]]
  18 KB (2,189 words) - 14:24, 9 August 2016
• Propositional calculus
  ...ession in the distinguished subset, typically interpreted as the subset of logical ''axioms''. ...t of operator symbols, variously interpreted as ''logical operators'' or ''logical connectives''. A ''well-formed formula'' (''wff'') is any atomic formula o
  17 KB (2,301 words) - 15:56, 7 November 2015
• Relation (mathematics)
  ...<math>\mathbb{B} = \{ 0, 1 \},\!</math> whose elements are interpreted as logical values, typically <math>0 = \mathrm{false}\!</math> and <math>1 = \mathrm{t ...theory, the relation <math>L\!</math> is seen as constituting a ''logical model'' or a ''relational structure'' that serves as one of many possible interpr
  20 KB (2,925 words) - 17:08, 14 November 2015
• User:Jon Awbrey/ARCHIVE
  # [[Futures Of Logical Graphs]] # [[Logical Graph]]
  39 KB (4,682 words) - 14:55, 21 May 2007
• User:Jon Awbrey/DIFF/B
  the logical side of the analogy a bit more fully, and to take up terms of a fixed number k of logical features. A "polymorphous set" is
  107 KB (9,168 words) - 14:23, 22 May 2007
• Directory:Jon Awbrey/Papers/Change In Logic
  the logical side of the analogy a bit more fully, and to take up terms of a fixed number k of logical features. A "polymorphous set" is
  73 KB (6,208 words) - 04:08, 11 December 2016
• Directory:Jon Awbrey/Papers/Functional Logic : Higher Order Propositions
  ...aterial, let's begin with a consideration of higher order propositions and logical operators that stem from the ordinary propositions on 1 and 2 variables. ...ath>\texttt{(} e_1 \texttt{,} \ldots \texttt{,} e_k \texttt{)},</math> and logical conjunctions, expressed as concatenated tuples of the form <math>e_1 ~ \ldo
  105 KB (15,890 words) - 03:12, 4 July 2013
• Directory:Peter Hale
  ...software systems that enable users to perform high level programming, and model the problem for which they are the experts. This is an alternative to the p ..., together with links to reasoning tools for maintaining and analysing the logical constructs (Storey et al, 2004) and (Elenius, 2005). The University of Vict
  19 KB (2,806 words) - 13:35, 22 April 2007
• Relation theory
  * Chang, C.C., and Keisler, H.J. (1973), ''Model Theory'', North-Holland, Amsterdam, Netherlands. * Poizat, Bruno (2000), ''A Course in Model Theory : An Introduction to Contemporary Mathematical Logic'', Moses Klein
  25 KB (3,665 words) - 21:04, 16 November 2015
• Directory:Jon Awbrey/Papers/Functional Logic : Quantification Theory
  ...h>\texttt{(} e_1 \texttt{,} \ldots \texttt{,} e_k \texttt{)},\!</math> and logical conjunctions, expressed as concatenated tuples of the form <math>e_1 ~\ldot ====Higher Order Propositions and Logical Operators (''n'' = 1)====
  81 KB (10,378 words) - 02:22, 5 July 2013
• Directory:Jon Awbrey/ELSEWHERE
  ...egard to an object, and it includes all forms of [[belief revision]] and [[logical inference]], including ''[[scientific method]]''. A sign-to-sign transactio ...ht up until the point where it becomes necessary to take up more precisely logical treatments of truth.
  33 KB (4,956 words) - 22:18, 25 January 2008
• Dynamics of inquiry
  ...ollow after others but are caused by them. Every mind which is capable of logical criticism of its inferences, must be aware of this determination of its ide :* The ''[[syllogistic]]'' approach treats inquiry as a species of logical process, and is limited to those of its aspects that can be related to the
  24 KB (3,783 words) - 00:25, 16 November 2015
• Directory:Aztecsoft
  Professional Services is a logical extension of our competence in software engineering services. We have devel ...iven Aztecians in 1999 as a model project to provide midday meals at Govt. Model Primary School, Yediyur, Bangalore
  11 KB (1,395 words) - 09:19, 11 April 2008
• Boolean algebras canonically defined
  ...particular the Boolean algebra of binary digits or bits 0 and 1 under the logical operations including disjunction, conjunction, and negation, and the [[alge A '''Boolean algebra''' is any model of the finitary equational theory of two values. That is, it is a set toge
  46 KB (7,114 words) - 18:24, 2 October 2007
• User:Jon Awbrey/DIFF/A
  ...spondence and [[C.S. Peirce]] also made use of differential operators in a logical context, but the exploration of these ideas has been hampered by a number o The first couple of operators that we need to consider are logical analogues of those that occur in the classical "finite difference calculus"
  112 KB (11,050 words) - 14:19, 22 May 2007
• Directory:Jon Awbrey/MathJax Problems
  ...mmon idiom in the use of order relation symbols, one that represents their logical conjunction by way of a concatenated syntax. Thus, <math>p \le q \le r\!</ ...iscourse <math>X.\!</math> Because the fiber of truth is used so often in logical contexts, it is convenient to define the more compact notation <math>[| f |
  59 KB (5,442 words) - 19:40, 8 November 2016
• Directory:Jon Awbrey/Papers/Peirce's Logic Of Information
  ...'' as a situation that can be represented in the following sort of bigraph model: ...e far more muddled than that and yet fall within the bounds of the bigraph model.
  73 KB (8,310 words) - 00:36, 27 April 2017
• Inquiry
  ...h the [[normative science]] of [[logic]]. In its inception, the pragmatic model or theory of inquiry was extracted by Peirce from its raw materials in clas ...that it provides us with doubly instructive exercises in the use of his [[logical graph]]s, taken at the level of his so-called '[[alpha graph]]s'.
  58 KB (7,676 words) - 22:34, 15 November 2015

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