• 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
Math 676. Some basics concerning absolute values A remarkable
Math 676. Some basics concerning absolute values A remarkable

... We now consider the case F = Q. We wish to determine all non-trivial absolute values on Q. We shall write | · |∞ to denote the usual absolute value, so (as one easily sees by working in R) | · |e∞ is an absolute value on Q for e > 0 if and only if e ≤ 1. In view of Theorem 1.1, these are precisely t ...
Weak Kripke Structures and LTL
Weak Kripke Structures and LTL

The Classification of Three-dimensional Lie Algebras
The Classification of Three-dimensional Lie Algebras

Chapter 2
Chapter 2

Measure Quantifier in Monadic Second Order Logic
Measure Quantifier in Monadic Second Order Logic

Model Theory of Modal Logic, Chapter in: Handbook of Modal Logic
Model Theory of Modal Logic, Chapter in: Handbook of Modal Logic

Determine whether each sequence is an arithmetic sequence. Write
Determine whether each sequence is an arithmetic sequence. Write

Nearly Prime Subsemigroups of βN
Nearly Prime Subsemigroups of βN

... In [11] it was shown that it is consistent with the usual axioms of set theory that βN, the Stone-Čech compactification of the positive integers, has maximal groups that are as small as possible. That is they are just copies of the group Z of integers. It was shown in fact that if e is the identity ...
Sequent Calculus in Natural Deduction Style
Sequent Calculus in Natural Deduction Style

PDF
PDF

The Fourier Algebra and homomorphisms
The Fourier Algebra and homomorphisms

A first course in mathematics (used for Math 327)
A first course in mathematics (used for Math 327)

Single tree grammars
Single tree grammars

When are induction and conduction functors isomorphic
When are induction and conduction functors isomorphic

- Journal of Algebra and Related Topics
- Journal of Algebra and Related Topics

Model Theory of Second Order Logic
Model Theory of Second Order Logic

... Turing-reducible to truth in M. This is the case even if we study just the valid Σ11 -sentences of second order logic. Proof. The theory of any second order characterizable structure is ∆2 (see below). The set of Gödel numbers of valid second order sentences is Π2 -complete (see below). A Π2 -comple ...
Subject: Mathematics Lesson: Isomorphism and Theorems on
Subject: Mathematics Lesson: Isomorphism and Theorems on

Fascicule 1
Fascicule 1

When an Extension of Nagata Rings Has Only Finitely Many
When an Extension of Nagata Rings Has Only Finitely Many

Logical Methods in Computer Science Vol. 8(4:19)2012, pp. 1–28 Submitted Oct. 27, 2011
Logical Methods in Computer Science Vol. 8(4:19)2012, pp. 1–28 Submitted Oct. 27, 2011

Sample pages 2 PDF
Sample pages 2 PDF

... cold but he is not very hungry, he would want to eat soup. Jill, on the other hand, never eats soup when it is cold. Assuming that at their place on any one day only one dish is cooked, express these conditions formally. Let S be the proposition for ‘today, Jack and Jill will eat soup’; H for ‘Jack ...
Lesson 1
Lesson 1

Specifying and Verifying Fault-Tolerant Systems
Specifying and Verifying Fault-Tolerant Systems

Holt McDougal Algebra 2
Holt McDougal Algebra 2

Fuzzy Sets - Computer Science | SIU
Fuzzy Sets - Computer Science | SIU

< 1 ... 7 8 9 10 11 12 13 14 15 ... 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