Search results

Jump to: navigation, search
  • Introductory Discrete Mathematics for Computer Science Topic:Discrete Mathematics for Computer Science Discrete mathematics/Number theory Topic:Discrete mathematics
    777 bytes (77 words) - 03:16, 17 July 2015
  • the first of two discrete math subjects for students of Computer Science at Wikiversity. The second course is called Discrete Mathematics for Computer Science
    11 KB (614 words) - 03:46, 12 January 2016
  • Logical matrix (category Discrete Mathematics)
    ☞ This page belongs to resource collections on Logic and Inquiry. A logical matrix, in the finite dimensional case, is a -dimensional array with entries
    4 KB (104 words) - 16:18, 11 November 2015
  • Boolean domain (category Discrete Mathematics)
    ☞ This page belongs to resource collections on Logic and Inquiry. A boolean domain is a generic 2-element set, say, whose elements are interpreted as
    4 KB (109 words) - 19:58, 5 November 2015
  • Welcome! This is a lesson in the Introductory Discrete Mathematics for Computer Science course here at Wikiversity. For computer science, it is necessary
    2 KB (102 words) - 17:13, 23 August 2014
  • Relation construction (category Discrete Mathematics)
    page belongs to resource collections on Logic and Inquiry. In logic and mathematics, relation construction and relational constructibility have to do with
    5 KB (173 words) - 19:24, 14 November 2015
  • Boolean function (category Discrete Mathematics)
    ☞ This page belongs to resource collections on Logic and Inquiry. A finitary boolean function is a function of the form where is a boolean domain and
    5 KB (134 words) - 20:26, 5 November 2015
  • Logic (A.pdf) Implications (A.pdf) MIT OCW Resolution (A.pdf) Function (A.pdf) Graph (A.pdf, H1.pdf)
    725 bytes (19 words) - 10:48, 16 June 2015
  • Boolean-valued function (category Discrete Mathematics)
    (1974), Discrete Computational Structures, Academic Press, New York, NY. Mathematical Society of Japan, Encyclopedic Dictionary of Mathematics, 2nd edition
    6 KB (358 words) - 21:18, 5 November 2015
  • Here are some exercises to practice your fluency with logical operators. Problem 1 Write statements using logical operators and different letters for the
    2 KB (87 words) - 18:24, 23 January 2009
  • An inversion is a pair of places of a permutation where the elements are out of their natural order. The unique inversion set of a permutation is the
    6 KB (146 words) - 19:25, 1 April 2013
  • Welcome! This is a lesson in the Introductory Discrete Mathematics for Computer Science course here at Wikiversity. Previous lesson: Biconditional Operator
    3 KB (241 words) - 20:12, 6 February 2016
  • Truth table (category Discrete Mathematics)
    ☞ This page belongs to resource collections on Logic and Inquiry. A truth table is a tabular array that illustrates the computation of a logical function
    16 KB (649 words) - 18:34, 7 November 2015
  • Ampheck (category Discrete Mathematics)
    Cambridge, MA, 1931–1935, 1958. Peirce, C.S. (1902), “The Simplest Mathematics”. First published as CP 4.227–323 in Collected Papers. Zellweger, Shea
    9 KB (660 words) - 15:06, 5 November 2015
  • Relation reduction (category Discrete Mathematics)
    page belongs to resource collections on Logic and Inquiry. In logic and mathematics, relation reduction and relational reducibility have to do with the extent
    29 KB (1,445 words) - 03:38, 15 November 2015
  • Relation theory (category Discrete Mathematics)
    perspective of combinatorics, in other words, as a subject matter in discrete mathematics, with special attention to finite structures and concrete set-theoretic
    24 KB (2,224 words) - 21:06, 16 November 2015
  • Welcome! This is a lesson in the Introductory Discrete Mathematics for Computer Science course here at Wikiversity. Previous lesson: Logical OR  : This
    1 KB (130 words) - 02:28, 28 October 2015
  • Welcome! This is a lesson in the Introductory Discrete Mathematics for Computer Science course here at Wikiversity. Previous lesson: Logical AND I apologize
    849 bytes (145 words) - 13:38, 4 August 2012
  • ☞ This page belongs to resource collections on Logic and Inquiry. In mathematics, a finitary relation is defined by one of the formal definitions given
    19 KB (1,745 words) - 17:12, 14 November 2015
  • true. What constitutes a proof may vary, depending on the field. In mathematics, a formal proof of a proposition is a chain of logical deductions leading
    7 KB (1,003 words) - 19:13, 3 July 2011

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