Open Logic Project Builds (Portuguese / pt-BR)
Open Logic Project Builds: Portuguese
This site contains PDFs built from
the source
LaTeX files of the most recent version of
the Open Logic
Text in Portuguese.
Complete PDFs
We have PDFs of the complete text in the Open Logic (Portuguese)
main branch, arranged in a somewhat sensible
manner, including editorial comments. It's not intended as a
textbook, but it shows what's there.
Individual Textbooks
There are already a few textbooks that show how one might "remix"
the material in the Open Logic Project to produce nice
textbooks. These vary in the material that's included, the design,
and the configuration options used. They may also include additional
material specific to those courses.
A textbook on metalogic, developed for Calgary's
Logic II course: includes the material on set theory, first-order
logic (including both sequent calculus and natural deduction), and
Turing machines (including undecidability). Appendices cover proofs
and induction and biographies of some logicians. This text also
includes chapter summaries and a glossary. Problems are collected at
the end of chapters.
A brief introduction
to the
philosophy of set theory; covers why set theory came about;
how to reduce large swathes of mathematics to set theory + arithmetic;
how to embed arithmetic in set theory;
what the cumulative iterative conception of set amounts to;
how one might try to justify the axioms of ZFC. Most of the material making up the text comes from Tim Button's Open Set Theory.
Parts, Chapters, Sections
-
sets-functions-relations-complete
-
sets
- basics
- subsets
- important-sets
- unions-and-intersections
- pairs-and-products
- russells-paradox
-
relations-complete
- relations-as-sets
- reflections
- special-properties
- equivalence-relations
- orders
- graphs
- trees
- operations
-
functions
- function-basics
- function-kinds
- functions-relations
- inverses
- composition
- isomorphic-functions
- partial-functions
-
size-of-sets-complete
- introduction
- enumerability
- zig-zag
- pairing
- pairing-alt
- non-enumerability
- reduction
- equinumerous-sets
- comparing-size
- schroder-bernstein
- enumerability-alt
- non-enumerability-alt
- reduction-alt
-
arithmetization
- integers
- rationals
- reals
- cuts
- reflections
- checking-details
- cauchy
-
infinite
- hilberts-hotel
- dedekind-algebra
- dedekind-induction
- dedekinds-proof
- card-sb
-
propositional-logic
-
syntax-and-semantics
- introduction
- formulas
- preliminaries
- formation-sequences
- valuations-sat
- semantic-notions
-
first-order-logic
-
introduction
- first-order-logic
- syntax
- formulas
- satisfaction
- sentences
- semantic-notions
- substitution
- models-theories
- soundness-completeness
-
syntax
- intro-syntax
- first-order-languages
- terms-formulas
- unique-readability
- main-operator
- subformulas
- formation-sequences
- free-vars-sentences
- substitution
-
semantics
- intro-semantics
- structures
- covered-structures
- satisfaction
- assignments
- extensionality
- semantic-notions
-
models-theories
- introduction
- expressing-props-of-structures
- theories
- expressing-relations
- set-theory
- size-of-structures
-
proof-systems
- introduction
- sequent-calculus
- natural-deduction
- tableaux
- axiomatic-deduction
-
sequent-calculus
- rules-and-proofs
- propositional-rules
- quantifier-rules
- structural-rules
- derivations
- proving-things
- proving-things-quant
- proof-theoretic-notions
- provability-consistency
- provability-propositional
- provability-quantifiers
- soundness
- identity
- soundness-identity
-
natural-deduction
- rules-and-proofs
- propositional-rules
- quantifier-rules
- derivations
- proving-things
- proving-things-quant
- proof-theoretic-notions
- provability-consistency
- provability-propositional
- provability-quantifiers
- soundness
- identity
- soundness-identity
-
tableaux
- rules-and-proofs
- propositional-rules
- quantifier-rules
- derivations
- proving-things
- proving-things-quant
- proof-theoretic-notions
- provability-consistency
- provability-propositional
- provability-quantifiers
- soundness
- identity
- soundness-identity
-
axiomatic-deduction
- rules-and-proofs
- axioms-rules-propositional
- axioms-rules-quantifiers
- proving-things
- proving-things-quant
- proof-theoretic-notions
- deduction-theorem
- deduction-theorem-quantifiers
- provability-consistency
- provability-propositional
- provability-quantifiers
- soundness
- identity
-
completeness
- introduction
- outline
- complete-consistent-sets
- henkin-expansions
- lindenbaums-lemma
- construction-of-model
- identity
- completeness-thm
- compactness
- compactness-direct
- downward-ls
-
beyond
- introduction
- many-sorted-logic
- second-order-logic
- higher-order-logic
- intuitionistic-logic
- modal-logics
- other-logics
-
model-theory
-
basics
- reducts-and-expansions
- substructures
- overspill
- isomorphism
- theory-of-m
- partial-iso
- dlo
- nonstandard-arithmetic
-
models-of-arithmetic
- introduction
- standard-models
- non-standard-models
- models-of-q
- models-of-pa
- computable-models
-
interpolation
- introduction
- separation
- interpolation-proof
- definability
-
lindstrom
- introduction
- abstract-logics
- ls-property
- lindstrom-proof
-
computability
-
recursive-functions
- introduction
- primitive-recursion
- composition
- pr-functions
- notation-pr-functions
- pr-functions-computable
- examples
- pr-relations
- bounded-minimization
- primes
- sequences
- trees
- other-recursions
- non-pr-functions
- partial-functions
- normal-form
- halting-problem
- general-recursive-functions
-
computability-theory
- introduction
- coding-computations
- normal-form
- s-m-n
- universal-part-function
- no-universal-function
- halting-problem
- russells-paradox
- computable-sets
- ce-sets
- equiv-ce-defs
- non-comp-set
- ce-closed-cup-cap
- complement-ce
- reducibility
- prop-reduce
- complete-ce-sets
- k-1
- total
- rice-theorem
- fixed-point-thm
- application-fixed-point
- def-functions-self-reference
-
turing-machines
-
machines-computations
- introduction
- representing-tms
- turing-machines
- configuration
- unary-numbers
- halting-states
- disciplined-machines
- combining-machines
- variants
- church-turing-thesis
-
undecidability
- introduction
- enumerating-tms
- universal-tm
- halting-problem
- decision-problem
- representing-tms
- verification
- unsolvability-decision-problem
- trakhtenbrot
-
incompleteness
-
introduction
- historical-background
- definitions
- overview
- undecidability
-
arithmetization-syntax
- introduction
- coding-symbols
- coding-terms
- coding-formulas
- substitution
- proofs-in-lk
- proofs-in-nd
- proofs-in-ax
-
representability-in-q
- introduction
- representable-comp
- beta-function
- prim-rec
- basic-representable
- composition-representable
- minimization-representable
- comp-representable
- representing-relations
- undecidability
- sigma1-completeness
-
theories-computability
- introduction
- q-is-ce
- oconsis-ext-of-q-undec
- extensions-of-q-not-decidable
- computably-axiomatizable
- complete-decidable
- first-incompleteness
- inseparability
- consis-with-q
- interpretability
-
incompleteness-provability
- introduction
- fixed-point-lemma
- first-incompleteness-thm
- rosser-thm
- godels-paper
- provability-conditions
- second-incompleteness-thm
- lob-thm
- tarski-thm
-
second-order-logic
-
syntax-and-semantics
- introduction
- terms-formulas
- satisfaction
- semantic-notions
- expressive-power
- inf-count
-
metatheory
- introduction
- second-order-arithmetic
- undecidability-and-axiomatizability
- compactness
- loewenheim-skolem
-
sol-and-set-theory
- introduction
- comparing-sets
- cardinalities
- power-of-continuum
-
lambda-calculus
-
introduction
- overview
- syntax
- reduction
- church-rosser
- currying
- lambda-definability
- lambda-computable
- computable-lambda
- basic-pr-lambda
- composition
- primitive-recursion
- fixed-point-combinator
- minimization
-
syntax
- terms
- unique-readability
- abbreviated-syntax
- free-variables
- substitution
- alpha
- de-bruijn
- term-revisited
- beta
- eta
-
church-rosser
- definitions-and-properties
- parallel-beta-reduction
- beta-reduction
- parallel-beta-eta-reduction
- beta-eta-reduction
-
lambda-definability
- introduction
- arithmetical-functions
- pairs
- truth-values
- lists
- primitive-recursive-functions
- fixpoints
- minimization
- partial-recursive-functions
- lambda-definable-recursive
-
many-valued-logic
-
syntax-and-semantics
- introduction
- connectives
- formulas
- matrices
- valuations-sat
- semantic-notions
- sublogics
-
three-valued-logics
- introduction
- lukasiewicz
- kleene
- goedel
- multiple-designation
-
infinite-valued-logics
- introduction
- lukasiewicz
- goedel
-
sequent-calculus
- introduction
- rules-and-proofs
- structural-rules
- propositional-rules
-
normal-modal-logic
-
syntax-and-semantics
- introduction
- language-modal-logic
- substitution
- relational-models
- truth-at-w
- truth-in-model
- modal-validity
- tautological-instances
- schemas
- entailment
-
frame-definability
- introduction
- properties-accessibility
- frames
- definability
- first-order-definability
- equivalence-S5
- second-order-definability
-
axioms-systems
- introduction
- normal-logics
- logics-proofs
- proofs-in-K
- derived-rules
- more-proofs-in-K
- duals
- proofs-modal-systems
- soundness
- systems-distinct
- provability-from-set
- provability-properties
- consistency
-
completeness
- introduction
- complete-consistent-sets
- lindenbaums-lemma
- modalities-ccs
- canonical-models
- truth-lemma
- completeness-K
- frame-completeness
-
filtrations
- introduction
- preliminaries
- filtrations-def
- examples-of-filtrations
- finite
- S5-fmp
- S5-decidable
- more-filtrations
- euclidean-filtrations
-
tableaux
- introduction
- rules-for-K
- proofs-in-K
- soundness
- more-rules
- more-soundness
- simple-S5
- completeness
- countermodels
-
sequent-calculus
- introduction
- rules-for-K
- proofs-in-K
- soundness
- more-rules
- more-soundness
- hypersequents-S5
-
applied-modal-logic
-
temporal-logic
- introduction
- temporal-logic-semantics
- properties-accessibility
- extra-temporal-operators
- possible-histories
-
epistemic-logic
- introduction
- language-epistemic-logic
- relational-models
- truth-at-w
- properties-accessibility
- bisimulations
- public-announcement-logic-lang
- public-announcement-logic-semantics
-
intuitionistic-logic
-
introduction
- constructive-reasoning
- syntax
- bhk-interpretation
- natural-deduction
- axiomatic-derivations
-
semantics
- introduction
- relational-models
- semantic-notions
- topological-semantics
-
soundness-completeness
- soundness-axd
- soundness-nd
- lindenbaum
- canonical-model
- truth-lemma
- completeness-thm
- decidability
-
tableaux
- introduction
- rules
- proofs
- soundness
- completeness
- countermodels
-
propositions-as-types
- introduction
- sequent-natural-deduction
- proof-terms
- proofs-to-terms
- terms-to-proofs
- reduction
- normalization
-
counterfactuals
-
introduction
- material-conditional
- paradoxes-material
- strict-conditional
- counterfactuals
-
minimal-change-semantics
- introduction
- sphere-models
- true-false
- antecedent-strengthening
- transitivity
- contraposition
-
set-theory
-
story
- extensionality
- russells-paradox-again
- predicativity
- cumulative-approach
- urelements
- grundgesetze
-
z
- story
- separation
- union
- pairs
- powerset
- infinity-again
- milestone
- nat
- arbintersections
-
ordinals
- introduction
- idea
- wo
- iso
- vn
- basic
- replacement
- milestone
- ordtype
- opps
-
spine
- idea
- recursion
- stagesbasics
- foundation
- zf
- rank
-
replacement
- introduction
- strength
- extrinsic
- limofsize
- absinf
- ref
- refproofs
- finiteaxiomatizability
-
ord-arithmetic
- introduction
- addition
- using-addition
- multiplication
- exponentiation
-
cardinals
- cp
- cardsasords
- milestone
- classing
- hp
-
card-arithmetic
- opps
- simp
- expotough
- ch
- fix
-
choice
- introduction
- tarskiscott
- hartogs
- wellorderingproblem
- countablechoice
- justifications
- banach
- vitali
-
methods
-
proofs
- introduction
- starting-proofs
- using-definitions
- inference-patterns
- example-1
- example-2
- proof-by-contradiction
- reading-proofs
- cant-do-it
- resources
-
induction
- introduction
- induction-on-N
- strong-induction
- inductive-definitions
- structural-induction
- relations
-
history
-
biographies
- georg-cantor
- alonzo-church
- gerhard-gentzen
- kurt-goedel
- emmy-noether
- rozsa-peter
- julia-robinson
- bertrand-russell
- alfred-tarski
- alan-turing
- ernst-zermelo
-
set-theory
- infinitesimals
- limits
- pathologies
- mythology
- cantor-plane
- hilbert-curve
-
reference
-
greek-alphabet
-
fraktur-alphabet
Generated from Git revision
a3d3f14
(2026-07-12)