• 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
Equivalent Expressions
Equivalent Expressions

Löwenheim-Skolem theorems and Choice principles
Löwenheim-Skolem theorems and Choice principles

A Finite Model Theorem for the Propositional µ-Calculus
A Finite Model Theorem for the Propositional µ-Calculus

Chapter 4 Lesson Packet
Chapter 4 Lesson Packet

18.703 Modern Algebra, The Isomorphism Theorems
18.703 Modern Algebra, The Isomorphism Theorems

Arithmetic Polygons
Arithmetic Polygons

Summer Math Packet
Summer Math Packet

full text (.pdf)
full text (.pdf)

Properties of Independently Axiomatizable Bimodal Logics
Properties of Independently Axiomatizable Bimodal Logics

AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic
AI Principles, Semester 2, Week 2, Lecture 5 Propositional Logic

What is "formal logic"?
What is "formal logic"?

Logic primer
Logic primer

2/TRUTH-FUNCTIONS
2/TRUTH-FUNCTIONS

chap08
chap08

Chapter 1
Chapter 1

... The immediate components of a formula are those formulas, if any, from which it is directly constructed. Thus the immediate components of (A∨ ∨ B) are A and B, and the sole immediate component of ¬A is A. p4 has no immediate components because it is not constructed out of anything, but is rather a p ...
Chapter 2  - Princeton University Press
Chapter 2 - Princeton University Press

MJ2A - Davidsen Middle School
MJ2A - Davidsen Middle School

Randy, Sue and Tom are siblings
Randy, Sue and Tom are siblings

... Contrapositives, converses, and inverses Definition Consider the implication p  q 1. The converse of the implication is 2. The inverse of the implication is 3. The contrapositive of the implication is Proposition 3 1. An implication and its contrapositive are logically equivalent 2. The converse a ...
Mathematical Review
Mathematical Review

$doc.title

File
File

Course 2 · Chapter 5 Expressions
Course 2 · Chapter 5 Expressions

Fraïssé`s conjecture in Pi^1_1-comprehension
Fraïssé`s conjecture in Pi^1_1-comprehension

... proof of FRA is the minimal bad array lemma, which is actually used all throughout betterquasi-ordering theory, and Marcone [Mar96] had proved that the minimal bad array lemma implies Π11 -CA0 . Instead, our new proof uses the work of the author from [Mon06] connecting FRA and the well-quasi-orderne ...
Title Goes Here
Title Goes Here

Park Forest Math Team
Park Forest Math Team

< 1 ... 119 120 121 122 123 124 125 126 127 ... 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