• Study Resource
  • Explore Categories
    • 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
rational numbers
rational numbers

... Are the integers of the form 3n closed under addition? Are the integers of the form 6n + 1 closed under subtraction? Are the integers of the form 6n + 1 closed under multiplication? Are the integers NOT of the form 3n closed under multiplication? ...
Set Theory - UVic Math
Set Theory - UVic Math

... Notice that every set is a subset of itself (why?), that is X ⊆ X for every set X. A more subtle point is that ∅ is a subset of every set A. According to the definition, this is the same as the logical implication x ∈ ∅ ⇒ x ∈ A which, in turn, is the same as the implication (x ∈ ∅) → (x ∈ A) being a ...
A kind of dynamic model of prime numbers 1 Introduction 2 Periodic
A kind of dynamic model of prime numbers 1 Introduction 2 Periodic

Identity in modal logic theorem proving
Identity in modal logic theorem proving

... and methods are applications of what it is legal to do within the proof theory. (In Whitehead ~ Russell, this amounts to finding substitution instances of formulas for propositional variables in the axioms, and applying Modus Ponens). Were one directly constructing proofs in Smullyan [14] tableaux s ...
Aristotle`s particularisation
Aristotle`s particularisation

CIRCULAR BINARY STRINGS WITHOUT ZIGZAGS Emanuele Munarini Norma Zagaglia Salvi
CIRCULAR BINARY STRINGS WITHOUT ZIGZAGS Emanuele Munarini Norma Zagaglia Salvi

... the logarithmic series. In this way several combinatorial operations on species become algebraic operations on series. In particular if a species S can be expressed by means of sums, products and compositions of other species S1 , . . . , Sk then its cardinality can be expressed in the same way in t ...
Introductory Mathematics
Introductory Mathematics

... for granted. Moreover we identify −0 with +0 so that it provides the link between the two sets. Definition ...
A SHORT PROOF FOR THE COMPLETENESS OF
A SHORT PROOF FOR THE COMPLETENESS OF

Comparing Infinite Sets - University of Arizona Math
Comparing Infinite Sets - University of Arizona Math

... A finite set has a first element, second element, until it reaches its kth element. It did not keep going forever on the number of elements in the finite set. In an infinite set, you still have the first element, second element, and so on. However there is no last element because the infinite set wi ...
Exam II Solutions
Exam II Solutions

Chapter 2 Summary
Chapter 2 Summary

Annals of Pure and Applied Logic Ordinal machines and admissible
Annals of Pure and Applied Logic Ordinal machines and admissible

1 - Mr Linseman`s wiki
1 - Mr Linseman`s wiki

... y = 3x – 5. a) Is this relation a direct variation or a partial variation? b) Identify the initial value of y. ______________ c) Identify the constant of variation. __________ d) Make a table of values for x-values from 0 to 4. x ...
Full text
Full text

Written
Written

... reflexive; (b) symmetric; (c) reflexive and symmetric; (d) reflexive and contain (1, 2); (e) symmetric and contain (1, 2); (f) anti-symmetric; (g) anti-symmetric and contain (1, 2); (h) symmetric and anti-symmetric; (i) reflexive, symmetric and anti-symmetric. a) Each of these relations must contain ...
A MODAL EXTENSION OF FIRST ORDER CLASSICAL LOGIC–Part
A MODAL EXTENSION OF FIRST ORDER CLASSICAL LOGIC–Part

On the number of real quadratic fields with class number divisible by 3,
On the number of real quadratic fields with class number divisible by 3,

Curry`s paradox, Lukasiewicz, and Field
Curry`s paradox, Lukasiewicz, and Field

Chapter 5 - Set Theory
Chapter 5 - Set Theory

Discrete Mathematics (2009 Spring) Basic Number Theory (n3.4gn3
Discrete Mathematics (2009 Spring) Basic Number Theory (n3.4gn3

06. Naive Set Theory
06. Naive Set Theory

A Concise Introduction to Mathematical Logic
A Concise Introduction to Mathematical Logic

Walking on real numbers
Walking on real numbers

... If αb,c and αd,e are two Stoneham constants both nonnormal to base B, as given in the previous result, with c and e multiplicatively independent, then the sum is also nonnormal base B." Ref: DHB and J. M. Borwein, “Nonnormality of the Stoneham constants, Ramanujan Journal, to appear, available at ht ...
Analysis of the paraconsistency in some logics
Analysis of the paraconsistency in some logics

Monadic Second Order Logic and Automata on Infinite Words
Monadic Second Order Logic and Automata on Infinite Words

< 1 ... 41 42 43 44 45 46 47 48 49 ... 85 >

List of first-order theories

In mathematical logic, a first-order theory is given by a set of axioms in somelanguage. This entry lists some of the more common examples used in model theory and some of their properties.
  • studyres.com © 2026
  • DMCA
  • Privacy
  • Terms
  • Report