• 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
The Model-Theoretic Ordinal Analysis of Theories of Predicative
The Model-Theoretic Ordinal Analysis of Theories of Predicative

Arithmetics in finite but potentially infinite worlds ∀ ∃ ∀ ∃
Arithmetics in finite but potentially infinite worlds ∀ ∃ ∀ ∃

Constraint Satisfaction Problems with Infinite Templates
Constraint Satisfaction Problems with Infinite Templates

Wumpus world in Propositional logic.
Wumpus world in Propositional logic.

the structure of certain operator algebras
the structure of certain operator algebras

On the Number of False Witnesses for a Composite Number
On the Number of False Witnesses for a Composite Number

c2_ch1_l1
c2_ch1_l1

Logic and Discrete Mathematics for Computer Scientists
Logic and Discrete Mathematics for Computer Scientists

John Nolt – Logics, chp 11-12
John Nolt – Logics, chp 11-12

First order formulas with modular predicates
First order formulas with modular predicates

Let`s Do Algebra Tiles
Let`s Do Algebra Tiles

Direct-sum decompositions over local rings
Direct-sum decompositions over local rings

... of analytic branches, one of which has high multiplicity. The second construction is less explicit: We start with a two-dimensional complete normal domain A with large divisor class group and then employ a remarkable theorem of Heitmann [He] to get a local unique factorization domain whose completio ...
On the characterization of compact Hausdorff X for which C(X) is
On the characterization of compact Hausdorff X for which C(X) is

the partition property for certain extendible
the partition property for certain extendible

HOLT 11-1 Simplifying Algebraic Expressions
HOLT 11-1 Simplifying Algebraic Expressions

Mathematics 220 Homework for Week 6 Due February
Mathematics 220 Homework for Week 6 Due February

The Art of Ordinal Analysis
The Art of Ordinal Analysis

MATH 311W Wksht 1 • A logical statement is a phrase that is
MATH 311W Wksht 1 • A logical statement is a phrase that is

Ascribing beliefs to resource bounded agents
Ascribing beliefs to resource bounded agents

... We consider it here not for its intrinsic interest but because it allows us to make a point concerning the logical omniscience assumption. In the remainder of this section we show that, under this model of belief ascription, the logical omniscience assumption is harmless, while if we extend it in a ...
Homological algebra
Homological algebra

SERRE DUALITY FOR NONCOMMUTATIVE PROJECTIVE
SERRE DUALITY FOR NONCOMMUTATIVE PROJECTIVE

ALGEBRA 1, D. CHAN 1. Introduction 1Introduction to groups via
ALGEBRA 1, D. CHAN 1. Introduction 1Introduction to groups via

Contemporary Abstract Algebra (6th ed.) by Joseph Gallian
Contemporary Abstract Algebra (6th ed.) by Joseph Gallian

Outlier Detection Using Default Logic
Outlier Detection Using Default Logic

Review - UT Computer Science
Review - UT Computer Science

... There are interesting first-order theories that are both consistent and complete with respect to particular interpretations of interest. One example is Presburger arithmetic, in which the universe is the natural numbers and there is a single function, plus, whose properties are axiomatized. There ar ...
< 1 ... 29 30 31 32 33 34 35 36 37 ... 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