• 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
On Graphs with Exactly Three Q-main Eigenvalues - PMF-a
On Graphs with Exactly Three Q-main Eigenvalues - PMF-a

... vertex set V(G) = {v1 , v2 , . . . , vn } and edge set E(G). For a graph G the order is |V(G)| = n and the size is |E(G)| = m; by deg(vi ) = di we denote the degree of the vertex vi . The cyclomatic number ω of G is defined as m − n + t where t is the number of connected components of G. If G is a c ...
ICSE Board Class X Mathematics Board Paper 2014 Solution (Two
ICSE Board Class X Mathematics Board Paper 2014 Solution (Two

functors of artin ringso
functors of artin ringso

Carnap and Quine on the analytic-synthetic - Philsci
Carnap and Quine on the analytic-synthetic - Philsci

3.6 First-Order Tableau
3.6 First-Order Tableau

Views: Compositional Reasoning for Concurrent Programs
Views: Compositional Reasoning for Concurrent Programs

Arithmetic Sequences 4.6
Arithmetic Sequences 4.6

... Because consecutive terms of an arithmetic sequence have a common difference, the sequence has a constant rate of change. So, the points represented by any arithmetic sequence lie on a line. You can use the first term and the common difference to write a linear function that describes an arithmetic ...
THE MIKHEEV IDENTITY IN RIGHT HOM
THE MIKHEEV IDENTITY IN RIGHT HOM

THE UNITARY DUAL FOR THE MULTIPLICATIVE GROUP OF
THE UNITARY DUAL FOR THE MULTIPLICATIVE GROUP OF

... Let F be a locally compact, nondiscrete, non-Archimedean field (i.e., a finite extension of Qp or a field of formal Laurent series over a finite field), and let D be a division algebra of degree n over F, so that [D: F) = n 2 • In this paper, we give a construction of all irreducible unitary represe ...
The Mikheev identity in right Hom
The Mikheev identity in right Hom

Arithmetic Sequences 4.6
Arithmetic Sequences 4.6

q - Mona Shores Blogs
q - Mona Shores Blogs

... flight, the Air Force arranged the seats for an air show in a “V” shape. Kevin, who loves airplanes, arrived very early and was given the front seat. There were three seats in the second row, and those were filled very quickly. The third row had five seats, which were given to the next five people w ...
The Development of Categorical Logic
The Development of Categorical Logic

071 Embeddings
071 Embeddings

On the strength of the finite intersection principle
On the strength of the finite intersection principle

... all j 6= i. Whenever we speak of making some Ai and Aj intersect, we shall mean enumerating some fresh odd number into both sets. To motivate the proof of the theorem, we first discuss the simpler construction of an A with no computable maximal subfamily with the D2 intersection property. By Remark ...
Algebra I – lecture notes
Algebra I – lecture notes

LECTURES ON ERGODIC THEORY OF GROUP ACTIONS (A VON
LECTURES ON ERGODIC THEORY OF GROUP ACTIONS (A VON

... Thus, the so and so∗ topologies coincide on U(H). Also, if ui tends to u in the wo topology then for any unit vector ξ ∈ H we have hui ξ, uξi → 1, thus kui ξ − uξk2 = 2 − 2Rehui ξ, uξi → 0, showing that ui converges so to u. The rest of the statement is trivial by the definitions. Q.E.D. An action o ...
Relevant deduction
Relevant deduction

... ‘approximative’ sense, but strictly speaking false. For example, Newton’s theory, although successful in explaining the physical laws in the ‘middle’ dimensions of space and velocity, turned out to be false for dimensions of very high speed and of very small space. In the same way, modern elementary ...
Deep Sequent Systems for Modal Logic
Deep Sequent Systems for Modal Logic

(pdf).
(pdf).

... Proof. Without loss of generality we may assume that the residue field is infinite. By Proposition [6, 2.3] it is enough to show that M is syzygetically Artin-Rees with respect to the family of all m-primary ideals. Let F be a free resolution of M . For every m-primary ideal I, choose a reduction (x ...
Quine`s Conjecture on Many-Sorted Logic∗ - Philsci
Quine`s Conjecture on Many-Sorted Logic∗ - Philsci

Pseudo-finite model theory
Pseudo-finite model theory

Logic: Semantics and Bottom-Up Proofs
Logic: Semantics and Bottom-Up Proofs

Relational Logic - Stanford Logic Group
Relational Logic - Stanford Logic Group

The Z-densities of the Fibonacci sequence
The Z-densities of the Fibonacci sequence

< 1 ... 32 33 34 35 36 37 38 39 40 ... 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