• Study Resource
  • Explore
    • Arts & Humanities
    • Business
    • Engineering & Technology
    • Foreign Language
    • History
    • Math
    • Science
    • Social Science

    Top subcategories

    • Advanced Math
    • Algebra
    • Basic Math
    • Calculus
    • Geometry
    • Linear Algebra
    • Pre-Algebra
    • Pre-Calculus
    • Statistics And Probability
    • Trigonometry
    • other →

    Top subcategories

    • Astronomy
    • Astrophysics
    • Biology
    • Chemistry
    • Earth Science
    • Environmental Science
    • Health Science
    • Physics
    • other →

    Top subcategories

    • Anthropology
    • Law
    • Political Science
    • Psychology
    • Sociology
    • other →

    Top subcategories

    • Accounting
    • Economics
    • Finance
    • Management
    • other →

    Top subcategories

    • Aerospace Engineering
    • Bioengineering
    • Chemical Engineering
    • Civil Engineering
    • Computer Science
    • Electrical Engineering
    • Industrial Engineering
    • Mechanical Engineering
    • Web Design
    • other →

    Top subcategories

    • Architecture
    • Communications
    • English
    • Gender Studies
    • Music
    • Performing Arts
    • Philosophy
    • Religious Studies
    • Writing
    • other →

    Top subcategories

    • Ancient History
    • European History
    • US History
    • World History
    • other →

    Top subcategories

    • Croatian
    • Czech
    • Finnish
    • Greek
    • Hindi
    • Japanese
    • Korean
    • Persian
    • Swedish
    • Turkish
    • other →
 
Profile Documents Logout
Upload
Paul Mitchener's notes
Paul Mitchener's notes

Artificial Intelligence
Artificial Intelligence

DISCRETE MATHEMATICAL STRUCTURES
DISCRETE MATHEMATICAL STRUCTURES

A LOGICAL SEMANTICS FOR NONMONOTONIC SORTS
A LOGICAL SEMANTICS FOR NONMONOTONIC SORTS

A survey on Interactive Theorem Proving
A survey on Interactive Theorem Proving

PDF file
PDF file

5. Equivalence Relations
5. Equivalence Relations

... Examples from Linear Algebra Linear algebra provides several examples of important and interesting equivalence relations. To set the stage, let ℝm×n denote the set of m×n matrices with real entries. First recall that the following are row operations on a matrix: 1. Multiply a row by a non-zero real ...
Representations of GL_2(A_Q^\infty)
Representations of GL_2(A_Q^\infty)

... tool in the study of smooth representations of TD groups. The idea is simple through the following analogy: Hecke algebras are to TD groups as group algebras are to finite groups. Namely, the Hecke algebra H (G) of a TD group G is made so that, essentially Repsm (G) = Modsm (H (G)) where the supersc ...
A logic-based theory of deductive arguments
A logic-based theory of deductive arguments

x - Loughborough University Intranet
x - Loughborough University Intranet

standards addressed in this unit
standards addressed in this unit

Abstract Algebra
Abstract Algebra

Introductory Notes in Discrete Mathematics
Introductory Notes in Discrete Mathematics

A Course in Modal Logic - Sun Yat
A Course in Modal Logic - Sun Yat

A Logical Foundation for Session
A Logical Foundation for Session

Functional Dependencies in a Relational Database and
Functional Dependencies in a Relational Database and

... We now give Codd’s definition. Assume that 9 is a database relation, and that each column of 9 has a unique “column name.” If A,, .. ., A,, B,, ..., Br are among the column names of 9 (they need not be distinct), then we say that A,, . . ., A, determine B,, . . ., B, (or B,, . . ., B, depend on A,, ...
Lecture Notes on the Lambda Calculus
Lecture Notes on the Lambda Calculus

Modules and Vector Spaces
Modules and Vector Spaces

Interpretability formalized
Interpretability formalized

Min terms and logic expression
Min terms and logic expression

Sequent Combinators: A Hilbert System for the Lambda
Sequent Combinators: A Hilbert System for the Lambda

Principle of Mathematical Induction
Principle of Mathematical Induction

Euclidian Roles in Description Logics
Euclidian Roles in Description Logics

... For example, in [2] the Description Logic RIQ is extended with several role axioms, like reflexive and irreflexive role axioms, disjoint role axioms and simple negation on roles. These extensions has motivated us to investigate possibilities of extending Description Logics with other role axioms. In ...
On the homology and homotopy of commutative shuffle algebras
On the homology and homotopy of commutative shuffle algebras

... Acknowledgement: I thank Teimuraz Pirashvili for several helpful discussions. The idea, that all common homology theories of commutative algebras should agree in the setting of symmetric sequences is due to him. John Rognes asked whether commutative shuffle algebras are divided power algebras in a s ...
Frobenius monads and pseudomonoids
Frobenius monads and pseudomonoids

< 1 2 3 4 5 6 7 8 9 10 ... 163 >

Laws of Form

Laws of Form (hereinafter LoF) is a book by G. Spencer-Brown, published in 1969, that straddles the boundary between mathematics and philosophy. LoF describes three distinct logical systems: The primary arithmetic (described in Chapter 4 of LoF), whose models include Boolean arithmetic; The primary algebra (Chapter 6 of LoF), whose models include the two-element Boolean algebra (hereinafter abbreviated 2), Boolean logic, and the classical propositional calculus; Equations of the second degree (Chapter 11), whose interpretations include finite automata and Alonzo Church's Restricted Recursive Arithmetic (RRA).Boundary algebra is Dr Philip Meguire's (2011) term for the union of the primary algebra (hereinafter abbreviated pa) and the primary arithmetic. ""Laws of Form"" sometimes loosely refers to the pa as well as to LoF.
  • studyres.com © 2025
  • DMCA
  • Privacy
  • Terms
  • Report