• 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
Lattices of Scott-closed sets - Mathematics and Mathematics Education
Lattices of Scott-closed sets - Mathematics and Mathematics Education

ALGEBRA Equations, formulae, expressions and identities 112 The
ALGEBRA Equations, formulae, expressions and identities 112 The

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

Back to Basics: Revisiting the Incompleteness
Back to Basics: Revisiting the Incompleteness

self-reference in arithmetic i - Utrecht University Repository
self-reference in arithmetic i - Utrecht University Repository

Variables and Expressions  (for Holt Algebra 1, Lesson 1-1)
Variables and Expressions (for Holt Algebra 1, Lesson 1-1)

Constraint propagation
Constraint propagation

Lecture 09
Lecture 09

Constraint Logic Programming with Hereditary Harrop Formula
Constraint Logic Programming with Hereditary Harrop Formula

... σ = [t1 /x1 , . . . , tn /xn ], using proper renaming of the variables bound in C to avoid capturing free variables from the terms ti , 1 ≤ i ≤ n. Γσ represents the application of σ to every constraint of the set Γ. In the sequel, the notation F σ will also be used for other formulas F , not necessa ...
Algebraic Set Theory (London Mathematical Society Lecture Note
Algebraic Set Theory (London Mathematical Society Lecture Note

... interesting examples of such universes C which are quite different from the usual universe of sets. Thus, C can be a universe of sheaves (i.e., sets which vary continuously over a fixed topological space of parameters), or an "effective" universe of recursive sets. More generally, C can be any eleme ...
EXTREMAL EFFECTIVE DIVISORS OF BRILL
EXTREMAL EFFECTIVE DIVISORS OF BRILL

... Nevertheless, the main result of this paper shows that the above question has a negative answer. Theorem 1.1. For every n ≥ 6, there exist extremal effective divisors in M1,n that are different from the Da ’s. See Theorems 3.3, 4.4 and 5.4 for a more precise statement. Let us explain our method. For ...
Simple On-the-fly Automatic Verification of Linear Temporal Logic, R. Gerth and D. Pele, ACM Digital Library
Simple On-the-fly Automatic Verification of Linear Temporal Logic, R. Gerth and D. Pele, ACM Digital Library

Ruler--Compass Constructions
Ruler--Compass Constructions

Elementary Logic
Elementary Logic

... Elementary Logic ...
Logic and Mathematical Reasoning
Logic and Mathematical Reasoning

Midpoints and Exact Points of Some Algebraic
Midpoints and Exact Points of Some Algebraic

Reductio ad Absurdum Argumentation in Normal Logic
Reductio ad Absurdum Argumentation in Normal Logic

... Now, because the three friends need to save money, they must minimize the number of places they will go to on vacation. So they start by assuming they are going nowhere — the cheapest solution. That is, they assume {not mountain, not beach, not travel} as true. According to the program above, with t ...
Yablo`s paradox
Yablo`s paradox

Notes on the Science of Logic
Notes on the Science of Logic

The logic of negationless mathematics
The logic of negationless mathematics

Thesis Proposal: A Logical Foundation for Session-based
Thesis Proposal: A Logical Foundation for Session-based

AN INTRODUCTION TO KK-THEORY These are the lecture notes of
AN INTRODUCTION TO KK-THEORY These are the lecture notes of

... (4) σL(E,F ) (K(E, F )) ⊂ K(E, F ) with σL(E,F ) (θf,e ) = θσF (f ),σE (e) for all e ∈ E and f ∈ F . COROLLARY 54. If E is a graded Hilbert B-module, then L(E) and K(E) are graded C ∗ -algebras. DEFINITION 55. The elements of L(E, F )0 are called even, written L(E, F )even , the elements of L(E, F ) ...
Canonicity and representable relation algebras
Canonicity and representable relation algebras

SEQUENT SYSTEMS FOR MODAL LOGICS
SEQUENT SYSTEMS FOR MODAL LOGICS

Homomorphisms and Topological Semigroups.
Homomorphisms and Topological Semigroups.

... tive topological semigroups and an extension of the theorem from groups which states that continuous homomorphisms are open mappings under suitable topological conditions. The second section is on the character semigroup (continuous complex valued homomorphisms) of compact topo­ logical semigroups. ...
< 1 ... 15 16 17 18 19 20 21 22 23 ... 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