|
Warning: this is an htmlized version!
The original is here, and the conversion rules are here. |
;; (find-sh "cd ~/books/ && find * | sort")
;; (find-sh "cd ~/books/__logic/ && find * | sort")
;; «.abramsky» (to "abramsky")
;; «.abramsky-lazy» (to "abramsky-lazy")
;; «.aczel» (to "aczel")
;; «.allen» (to "allen")
;; «.allwein-barwise» (to "allwein-barwise")
;; «.altenkirch» (to "altenkirch")
;; «.altenkirch-dtwos» (to "altenkirch-dtwos")
;; «.andrews» (to "andrews")
;; «.aschieri-zorzi» (to "aschieri-zorzi")
;; «.atten» (to "atten")
;; «.baader-nipkow» (to "baader-nipkow")
;; «.barendregt» (to "barendregt")
;; «.barthe» (to "barthe")
;; «.barwise» (to "barwise")
;; «.barwise-etchemendy» (to "barwise-etchemendy")
;; «.barwise-moss» (to "barwise-moss")
;; «.beeson-narboux-wiedijk» (to "beeson-narboux-wiedijk")
;; «.bell-machover» (to "bell-machover")
;; «.benthem» (to "benthem")
;; «.bernays» (to "bernays")
;; «.beziau» (to "beziau")
;; «.bierman-depaiva» (to "bierman-depaiva")
;; «.birkedal» (to "birkedal")
;; «.blok-pigozzi» (to "blok-pigozzi")
;; «.brown» (to "brown")
;; «.debruijn» (to "debruijn")
;; «.debruijn-telesc» (to "debruijn-telesc")
;; «.bueno» (to "bueno")
;; «.bunder-seldin» (to "bunder-seldin")
;; «.carnap» (to "carnap")
;; «.carnielli» (to "carnielli")
;; «.carnielli-coniglio» (to "carnielli-coniglio")
;; «.chagrov» (to "chagrov")
;; «.changkeisler» (to "changkeisler")
;; «.chew» (to "chew")
;; «.chuaqui» (to "chuaqui")
;; «.ciabattoni-ferrari» (to "ciabattoni-ferrari")
;; «.coniglio» (to "coniglio")
;; «.conway» (to "conway")
;; «.copi» (to "copi")
;; «.coquand» (to "coquand")
;; «.coquand-huet» (to "coquand-huet")
;; «.corcoran» (to "corcoran")
;; «.corcoran-alaimi» (to "corcoran-alaimi")
;; «.crossley-dummett» (to "crossley-dummett")
;; «.curry» (to "curry")
;; «.dagostino» (to "dagostino")
;; «.damas» (to "damas")
;; «.davis» (to "davis")
;; «.degroote-hindley» (to "degroote-hindley")
;; «.devlin» (to "devlin")
;; «.dore» (to "dore")
;; «.dummett» (to "dummett")
;; «.ebbinghaus» (to "ebbinghaus")
;; «.enderton» (to "enderton")
;; «.farmer» (to "farmer")
;; «.farmer-chiron» (to "farmer-chiron")
;; «.feferman» (to "feferman")
;; «.fenstadt» (to "fenstadt")
;; «.ferreira» (to "ferreira")
;; «.fitting» (to "fitting")
;; «.flower-masthoff-stapleton» (to "flower-masthoff-stapleton")
;; «.frade» (to "frade")
;; «.fraenkel» (to "fraenkel")
;; «.fraser» (to "fraser")
;; «.gabbay» (to "gabbay")
;; «.gentzen» (to "gentzen")
;; «.geuvers» (to "geuvers")
;; «.giardino» (to "giardino")
;; «.girard» (to "girard")
;; «.girard-blind-spot» (to "girard-blind-spot")
;; «.girard-tcs87» (to "girard-tcs87")
;; «.girard-tet» (to "girard-tet")
;; «.godel» (to "godel")
;; «.goranko» (to "goranko")
;; «.grande» (to "grande")
;; «.grande-silva» (to "grande-silva")
;; «.krantz-parks» (to "krantz-parks")
;; «.gries-schneider» (to "gries-schneider")
;; «.gun» (to "gun")
;; «.handbook-of-logic-in-CS» (to "handbook-of-logic-in-CS")
;; «.henkin» (to "henkin")
;; «.herbelin» (to "herbelin")
;; «.hermogenesoliveira» (to "hermogenesoliveira")
;; «.hesseling» (to "hesseling")
;; «.heyting» (to "heyting")
;; «.hindley» (to "hindley")
;; «.hindley-seldin2» (to "hindley-seldin2")
;; «.hintikka» (to "hintikka")
;; «.hofstadter» (to "hofstadter")
;; «.howard» (to "howard")
;; «.hott» (to "hott")
;; «.hrbacek-jech» (to "hrbacek-jech")
;; «.humberstone» (to "humberstone")
;; «.hurd» (to "hurd")
;; «.hurd-loeb» (to "hurd-loeb")
;; «.hurkens» (to "hurkens")
;; «.jamnik» (to "jamnik")
;; «.kamareddine» (to "kamareddine")
;; «.kelley» (to "kelley")
;; «.kleene» (to "kleene")
;; «.knuth» (to "knuth")
;; «.kohlenbach» (to "kohlenbach")
;; «.kripke» (to "kripke")
;; «.krivine» (to "krivine")
;; «.kubota» (to "kubota")
;; «.kunen» (to "kunen")
;; «.lacompling2018» (to "lacompling2018")
;; «.landau» (to "landau")
;; «.leary» (to "leary")
;; «.lecomte» (to "lecomte")
;; «.leeds1990» (to "leeds1990")
;; «.leroy» (to "leroy")
;; «.lifschitz» (to "lifschitz")
;; «.lukasiewicz» (to "lukasiewicz")
;; «.luo» (to "luo")
;; «.luo-callaghan» (to "luo-callaghan")
;; «.luo-proofirr» (to "luo-proofirr")
;; «.luxemburg-robinson» (to "luxemburg-robinson")
;; «.machover» (to "machover")
;; «.machover-hirschfeld» (to "machover-hirschfeld")
;; «.maddy» (to "maddy")
;; «.marcos» (to "marcos")
;; «.martin-lof» (to "martin-lof")
;; «.martin-lof-cmcp» (to "martin-lof-cmcp")
;; «.martin-lof-as» (to "martin-lof-as")
;; «.martin-lof-mean» (to "martin-lof-mean")
;; «.martin-lof-atot» (to "martin-lof-atot")
;; «.martin-lof-ittpp» (to "martin-lof-ittpp")
;; «.martin-lof-transcriptions» (to "martin-lof-transcriptions")
;; «.meleiro» (to "meleiro")
;; «.mendelson» (to "mendelson")
;; «.mints» (to "mints")
;; «.monin-ene-perin» (to "monin-ene-perin")
;; «.moraes-queiroz» (to "moraes-queiroz")
;; «.mortari» (to "mortari")
;; «.mortensen» (to "mortensen")
;; «.mummaphd» (to "mummaphd")
;; «.nederpelt» (to "nederpelt")
;; «.nederpelt-geuvers» (to "nederpelt-geuvers")
;; «.negarestani» (to "negarestani")
;; «.negri-vonplato» (to "negri-vonplato")
;; «.nelson» (to "nelson")
;; «.nolt-rohatyn» (to "nolt-rohatyn")
;; «.nordstrom» (to "nordstrom")
;; «.nye» (to "nye")
;; «.oliva» (to "oliva")
;; «.open-logic» (to "open-logic")
;; «.paleo-delahaye» (to "paleo-delahaye")
;; «.papineau» (to "papineau")
;; «.patterson» (to "patterson")
;; «.paulin-mohring» (to "paulin-mohring")
;; «.pelletier» (to "pelletier")
;; «.pohlers» (to "pohlers")
;; «.pradic-brown» (to "pradic-brown")
;; «.prawitz» (to "prawitz")
;; «.priest» (to "priest")
;; «.priest-incl» (to "priest-incl")
;; «.reid» (to "reid")
;; «.restall» (to "restall")
;; «.reynolds» (to "reynolds")
;; «.robinson» (to "robinson")
;; «.rose-shepherdson» (to "rose-shepherdson")
;; «.russell» (to "russell")
;; «.sambin-smith» (to "sambin-smith")
;; «.saracino-weispfenning» (to "saracino-weispfenning")
;; «.scheele» (to "scheele")
;; «.second-order» (to "second-order")
;; «.shieh» (to "shieh")
;; «.shin» (to "shin")
;; «.smith» (to "smith")
;; «.smith-ifl» (to "smith-ifl")
;; «.smith-igt» (to "smith-igt")
;; «.smullyan» (to "smullyan")
;; «.smullyan» (to "smullyan")
;; «.spencer-brown» (to "spencer-brown")
;; «.steinhart» (to "steinhart")
;; «.stenlund» (to "stenlund")
;; «.stroyan» (to "stroyan")
;; «.stroyan-luxemburg» (to "stroyan-luxemburg")
;; «.szabo-arpad» (to "szabo-arpad")
;; «.tarski» (to "tarski")
;; «.tarskiaot» (to "tarskiaot")
;; «.tarskisclh» (to "tarskisclh")
;; «.trafford» (to "trafford")
;; «.troelstra» (to "troelstra")
;; «.umezawa» (to "umezawa")
;; «.vaananen» (to "vaananen")
;; «.van_dalen» (to "van_dalen")
;; «.vandenberg-neves» (to "vandenberg-neves")
;; «.vandoulakis» (to "vandoulakis")
;; «.vonplato» (to "vonplato")
;; «.wickerson-dodds-parkinson» (to "wickerson-dodds-parkinson")
;; «.wiedijk» (to "wiedijk")
;; «.wiedijk-dbf» (to "wiedijk-dbf")
;; «.wilander» (to "wilander")
;; «.velleman» (to "velleman")
;; «.victor-nascimento» (to "victor-nascimento")
;; «.automath» (to "automath")
;; «.ctt» (to "ctt")
;; «.games» (to "games")
;; «.iapt-buffalo68» (to "iapt-buffalo68")
;; «.logic-and-alg-spec» (to "logic-and-alg-spec")
;; «.nsa» (to "nsa")
;; «.tableaux» (to "tableaux")
;; «.tapsoft93» (to "tapsoft93")
;; «.term-rewriting» (to "term-rewriting")
;; «.typetheory» (to "typetheory")
;; «abramsky» (to ".abramsky")
;; http://gigapedia.com/items/124504/handbook-of-logic-in-computer-science-5
(code-djvu "hlics5" "~/books/__logic/abramsky_gabbay_maibaum__handbook_of_logic_in_computer_science__vol_5.djvu")
(code-djvutotext "hlics5" "~/books/__logic/abramsky_gabbay_maibaum__handbook_of_logic_in_computer_science__vol_5.djvu")
;; (find-hlics5page 9 "Contents")
;; (find-hlics5page (+ 18 1) "Nordstrom")
;; (find-hlics5page (+ 18 39) "Categorical Logic")
;; (find-hlics5page (+ 18 78) "Hyperdoctrines")
;; (find-hlics5text "")
;; «abramsky-lazy» (to ".abramsky-lazy")
;; The Lazy Lambda Calculus (2006)
;; https://www.cs.ox.ac.uk/files/293/lazy.pdf
(code-pdf-page "abramskylazy" "$S/https/www.cs.ox.ac.uk/files/293/lazy.pdf")
(code-pdf-text "abramskylazy" "$S/https/www.cs.ox.ac.uk/files/293/lazy.pdf")
;; (find-abramskylazypage)
;; (find-abramskylazytext)
;; «aczel» (to ".aczel")
;; http://www.cs.man.ac.uk/~petera/russ-praw.ps.gz
;; http://www.cs.man.ac.uk/~petera/russ-praw.pdf
;; «allen» (to ".allen")
;; (find-books "__logic/__logic.el" "allen")
;; Stuart Allen: "A Non-Type-Theoretic Definition of Martin-Löf's Types" (1987)
;; http://www.cs.cornell.edu/Info/Projects/NuPrl/documents/Allen/lics87.html
;; http://www.cs.cornell.edu/Info/Projects/NuPrl/documents/Allen/TR87-832-RESET.ps
(code-pdf-page "allenntt" "$S/http/www.cs.cornell.edu/Info/Projects/NuPrl/documents/Allen/TR87-832-RESET.pdf")
(code-pdf-text "allenntt" "$S/http/www.cs.cornell.edu/Info/Projects/NuPrl/documents/Allen/TR87-832-RESET.pdf")
;; (find-allennttpage)
;; (find-allenntttext)
;; «allwein-barwise» (to ".allwein-barwise")
;; http://gigapedia.com/items/120086/logical-reasoning-with-diagrams--studies-in-logic-and-computation-
(code-xpdf "logreaswithdiags" "~/books/__logic/allwein_barwise__logical_reasoning_with_diagrams.pdf")
;; (find-logreaswithdiagspage 13 "Contents")
;; (find-logreaswithdiagspage (+ 16 49) "Diagrams and the Concept of Logical Systems")
;; (find-logreaswithdiagspage (+ 16 81) "Situation-theoretic Account of Valid Reasoning with Venn Diagrams")
;; (find-logreaswithdiagspage (+ 16 267) "Index")
;; «altenkirch» (to ".altenkirch")
;; (find-books "__logic/__logic.el" "altenkirch")
;; http://www.cs.nott.ac.uk/~psztxa/
;; http://www.cs.nott.ac.uk/~psztxa/publ/
;; http://www.cs.nott.ac.uk/~psztxa/publ/fomus19.pdf
;; Thorsten Altenkirch: "Naive Type Theory"
(code-pdf-page "altenkirchntt" "$S/http/www.cs.nott.ac.uk/~psztxa/publ/fomus19.pdf")
(code-pdf-text "altenkirchntt" "$S/http/www.cs.nott.ac.uk/~psztxa/publ/fomus19.pdf")
;; (find-altenkirchnttpage)
;; (find-altenkirchntttext)
;; (find-altenkirchnttpage 1 "1 Introduction")
;; (find-altenkirchnttpage 2 "2 Type Theory vs Set Theory")
;; (find-altenkirchnttpage 3 "choice of representation")
;; (find-altenkirchntttext 3 "choice of representation")
;; (find-altenkirchnttpage 3 "type of its evidence")
;; (find-altenkirchntttext 3 "type of its evidence")
;; (find-altenkirchnttpage 4 "3 Non-dependent types")
;; (find-altenkirchnttpage 4 "3.1 Universes")
;; (find-altenkirchnttpage 4 "3.2 Functions")
;; (find-altenkirchnttpage 5 "3.3 Products and sums")
;; (find-altenkirchnttpage 7 "4 Dependent types")
;; (find-altenkirchnttpage 8 "4.1 -types and -types")
;; (find-altenkirchnttpage 10 "4.2 Induction and recursion")
;; (find-altenkirchnttpage 12 "4.3 The equality type")
;; (find-altenkirchnttpage 14 "5 Homotopy Type Theory")
;; (find-altenkirchnttpage 14 "5.1 Proof relevant equality")
;; (find-altenkirchnttpage 15 "5.2 What is a proposition?")
;; (find-altenkirchnttpage 17 "5.3 Dimensions of types")
;; (find-altenkirchnttpage 19 "5.4 Extensionality and univalence")
;; (find-altenkirchnttpage 22 "5.5 Higher Inductive Types")
;; (find-altenkirchnttpage 26 "5.6 Example: Definition of the Integers")
;; «altenkirch-dtwos» (to ".altenkirch-dtwos")
;; (find-books "__logic/__logic.el" "altenkirch-dtwos")
;; Altenkirch/Danielsson/Loh/Oury: "PiSigma: Dependent Types without the Sugar"
;; https://www.andres-loeh.de/PiSigma/PiSigma.pdf
;; (find-fline "$S/https/www.andres-loeh.de/PiSigma/")
(code-pdf-page "deptypeswosugar" "$S/https/www.andres-loeh.de/PiSigma/PiSigma.pdf")
(code-pdf-text "deptypeswosugar" "$S/https/www.andres-loeh.de/PiSigma/PiSigma.pdf")
;; (find-deptypeswosugarpage)
;; (find-deptypeswosugartext)
;; «andrews» (to ".andrews")
;; (find-books "__logic/__logic.el" "andrews")
(code-pdf "andrewstttp" "~/books/__logic/andrews__an_introduction_to_mathematical_logic_and_type_theory_to_truth_through_proof.pdf")
(code-pdftotext "andrewstttp" "~/books/__logic/andrews__an_introduction_to_mathematical_logic_and_type_theory_to_truth_through_proof.pdf" 13)
;; (find-andrewstttppage)
;; (find-andrewstttppage 6 "Contents")
;; (find-andrewstttptext 6 "Contents")
;; (find-andrewstttppage (+ 13 383) "Index")
;; (find-andrewstttptext (+ 13 383) "Index")
;; (find-andrewstttptext "")
;; «aschieri-zorzi» (to ".aschieri-zorzi")
;; Federico Aschieri/Margherita Zorzi: "On Natural Deduction in
;; Classical First-Order Logic: Curry-Howard Correspondence, Strong
;; Normalization and Herbrand's Theorem"
;; https://www.sciencedirect.com/science/article/pii/S0304397516001596
;; https://dmg.tuwien.ac.at/aschieri/EMherbrandFinal.pdf
(code-pdf-page "aschieri-zorzi" "$S/https/dmg.tuwien.ac.at/aschieri/EMherbrandFinal.pdf")
(code-pdf-text "aschieri-zorzi" "$S/https/dmg.tuwien.ac.at/aschieri/EMherbrandFinal.pdf")
;; (find-aschieri-zorzipage)
;; (find-aschieri-zorzitext)
;; «atten» (to ".atten")
;; (find-books "__logic/__logic.el" "atten")
(code-pdf-page "atten100" "~/books/__logic/atten_et_al_eds__one_hundred_years_of_intuitionism.pdf")
(code-pdf-text "atten100" "~/books/__logic/atten_et_al_eds__one_hundred_years_of_intuitionism.pdf" 12)
;; (find-atten100page)
;; (find-atten100page 7 "Contents")
;; (find-atten100text 7 "Contents")
;; (find-atten100page (+ 12 1) "Part I: Brouwer and Brouwerian intuitionism")
;; (find-atten100page (+ 12 3) "Another look at Brouwer's dissertation")
;; (find-atten100page (+ 12 21) "Brouwerian infinity")
;; (find-atten100page (+ 12 37) "The new intuitionism")
;; (find-atten100page (+ 12 50) "Truth and experience of truth")
;; (find-atten100page (+ 12 60) "The proper explanation of intuitionistic logic: on Brouwer's demonstration of the Bar Theorem")
;; (find-atten100page (+ 12 78) "The intersection of intuitionism (Brouwer) and phenomenology (Husserl)")
;; (find-atten100page (+ 12 96) "Brouwer on `hypotheses' and the middle Wittgenstein")
;; (find-atten100page (+ 12 115) "Brouwer's notion of intuition and theory of knowledge by presence.")
;; (find-atten100page (+ 12 131) "Buddhist models of the mind and the common core thesis on mysticism")
;; (find-atten100page (+ 11 147) "Part II: Kindred spirits")
;; (find-atten100page (+ 10 149) "Remarks on the supposed French `semi-' or `pre-intuitionism'.")
;; (find-atten100page (+ 10 163) "Poincaré: intuitionism, intuition, and convention")
;; (find-atten100page (+ 10 178) "Some of Julius König's mathematical dreams in his New Foundations of Logic, Arithmetic, and Set Theory")
;; (find-atten100page (+ 10 198) "Gödel, constructivity, impredicativity, and feasibility.")
;; (find-atten100page (+ 10 214) "Lorenzen's operative justification of intuitionistic logic")
;; (find-atten100page (+ 10 241) "Part III: Mathematical perspectives")
;; (find-atten100page (+ 9 243) "The Hilbert-Brouwer controversy resolved?")
;; (find-atten100page (+ 9 257) "Proof theory and Martin-Löf Type Theory")
;; (find-atten100page (+ 9 280) "Some remarks on linear logic")
;; (find-atten100page (+ 9 301) "Two applications of dynamic constructivism: Brouwer's continuity principle and choice sequences in formal topology")
;; (find-atten100page (+ 9 316) "A reverse look at Brouwer's Fan Theorem")
;; (find-atten100page (+ 9 326) "Some applications of Brouwer's Thesis on Bars")
;; (find-atten100page (+ 9 341) "Concluding remarks at the Cerisy conference")
;; (find-atten100page (+ 9 343) "A bibliography of L.E.J. Brouwer")
;; (find-atten100page (+ 9 391) "References")
;; (find-atten100page (+ 9 417) "Index of citations")
;; (find-atten100page (+ 12 3) "Another look at Brouwer's dissertation")
;; (find-atten100page (+ 1 189) "Index")
;; (find-atten100text "")
;; «baader-nipkow» (to ".baader-nipkow")
;; «term-rewriting» (to ".term-rewriting")
;; http://gigapedia.com/items/329059/term-rewriting-and-all-that
(code-djvu "termrewrit" "~/books/__logic/baader_nipkow__term_rewriting_and_all_that.djvu")
(code-djvutotext "termrewrit" "~/books/__logic/baader_nipkow__term_rewriting_and_all_that.djvu" 11)
;; (find-termrewritpage 5 "Contents")
;; (find-termrewritpage (+ 11 1) "Chapter 1")
;; (find-termrewritpage (+ 11 278) "A Bluffer's Guide to ML")
;; (find-termrewritpage (+ 11 297) "Index")
;; «barendregt» (to ".barendregt")
;; (find-books "__logic/__logic.el" "barendregt")
;; https://dl.acm.org/doi/10.5555/162552.162561
;; https://ttic.uchicago.edu/~dreyer/course/papers/barendregt.pdf
(code-pdf-page "bdrgt" "$S/https/ttic.uchicago.edu/~dreyer/course/papers/barendregt.pdf")
(code-pdf-text "bdrgt" "$S/https/ttic.uchicago.edu/~dreyer/course/papers/barendregt.pdf")
;; (find-bdrgtpage)
;; (find-bdrgtpage 2 "Contents")
;; (find-bdrgtpage (+ 1 77) "Cube")
;; (find-bdrgtpage (+ 1 86) "Abstraction rule")
;; (find-bdrgttext)
;; «barthe» (to ".barthe")
;; (find-books "__logic/__logic.el" "barthe")
;; https://link.springer.com/chapter/10.1007/BFb0014042
(code-pdf-page "barthe" "~/books/__logic/barthe__extensions_of_pure_type_systems.pdf")
(code-pdf-text "barthe" "~/books/__logic/barthe__extensions_of_pure_type_systems.pdf" -15)
;; (find-barthepage)
;; (find-barthetext)
;; (find-barthepage (+ -15 31) "Appendix: pure type systems with strong sums")
;; (find-barthetext (+ -15 31) "Appendix: pure type systems with strong sums")
;; «barwise» (to ".barwise")
;; http://gigapedia.com/items/35813/handbook-of-mathematical-logic--studies-in-logic-and-the-foundations-of-mathematics-
(code-djvu "barwisehandbook" "~/books/__logic/barwise__handbook_of_mathematical_logic.djvu")
(code-djvutotext "barwisehandbook" "~/books/__logic/barwise__handbook_of_mathematical_logic.djvu")
;; (find-barwisehandbookpage 10 "Contents")
;; (find-barwisehandbookpage (+ 12 283) "Kock, Reyes" "Doctrines in Categorical Logic")
;; (find-barwisehandbookpage (+ 12 284) "only differ in what operations are considered primitve and which derived")
;; (find-barwisehandbookpage (+ 12 289) "functor ``circle''")
;; (find-barwisehandbookpage (+ 12 305) "recursive")
;; (find-barwisehandbookpage (+ 12 453) "classes")
;; (find-barwisehandbookpage (+ 12 453) "Devlin" "Constructibility")
;; (find-barwisehandbookpage (+ 12 739) "Aczel" "An introduction to inductive definitions")
;; (find-barwisehandbooktext "")
;; «barwise-etchemendy» (to ".barwise-etchemendy")
;; (find-books "__logic/__logic.el" "barwise-etchemendy")
;; (find-es "tex" "lplfitch")
(code-xpdf "barwiseetchemendy" "~/books/__logic/barwise_etchemendy__language_proof_and_logic.pdf")
(code-pdftotext "barwiseetchemendy" "~/books/__logic/barwise_etchemendy__language_proof_and_logic.pdf" 10)
;; Old
;; (find-barwiseetchemendypage (+ 10 22) "Cube(a)")
;; (find-barwiseetchemendytext (+ 10 22) "Cube(a)")
;; (find-barwiseetchemendypage (+ 10 150) "or-elim")
;; (find-barwiseetchemendypage (+ 10 206) "->-intro")
;; (find-barwiseetchemendypage (+ 10 342) "Fa-elim")
;; (find-barwiseetchemendypage (+ 10 343) "Fa-intro")
;; (find-barwiseetchemendypage (+ 10 347) "Ex-intro")
;; (find-barwiseetchemendypage (+ 10 348) "Ex-elim")
;; (find-barwiseetchemendypage (+ 14 559) "First-order rules")
;; (find-barwiseetchemendypage (+ 14 562) "Glossary")
;; (find-barwiseetchemendypage (+ 14 573) "Summary of rules")
;; (find-barwiseetchemendypage (+ 14 579) "Glossary")
;; (find-barwiseetchemendypage (+ 14 579) "General Index")
;; (find-barwiseetchemendytext "")
;; trim = function (str) return (str:match "^ *(.-) *$") end
;; redsp = function (str) return (str:gsub(" +", " ")) end
;; PP(trim(" ab cd ef "))
;; PP(redsp("ab cd e f"))
;; titi = function (str) return str:match("^(.-) *([0-9]+)$") end
;; tif = function (tit, p)
;; if tit then
;; printf(";; (find-barwiseetchemendypage (+ 10 %3s) \"%s\")\n", p, tit)
;; end end
;; f = function (str) tif(titi(redsp(trim(str)))) end
;; fs = function (bigstr) for _,li in ipairs(splitlines(bigstr)) do f(li) end end
;; (find-barwiseetchemendypage)
;; (find-barwiseetchemendytext)
;; (find-barwiseetchemendypage 9 "Contents")
;; (find-barwiseetchemendypage (+ 14 1) "Introduction")
;; (find-barwiseetchemendypage (+ 14 1) "The special role of logic in rational inquiry")
;; (find-barwiseetchemendypage (+ 14 2) "Why learn an artificial language?")
;; (find-barwiseetchemendypage (+ 14 4) "Consequence and proof")
;; (find-barwiseetchemendypage (+ 14 5) "Instructions about homework exercises (essential!)")
;; (find-barwiseetchemendypage (+ 14 10) "To the instructor")
;; (find-barwiseetchemendypage (+ 14 15) "Web address")
;; (find-barwiseetchemendypage (+ 14 17) "I Propositional Logic")
;; (find-barwiseetchemendypage (+ 14 19) "1 Atomic Sentences")
;; (find-barwiseetchemendypage (+ 14 19) "1.1 Individual constants")
;; (find-barwiseetchemendypage (+ 14 20) "1.2 Predicate symbols")
;; (find-barwiseetchemendypage (+ 14 23) "1.3 Atomic sentences")
;; (find-barwiseetchemendypage (+ 14 26) "Cube(a)")
;; (find-barwiseetchemendypage (+ 14 28) "1.4 General first-order languages")
;; (find-barwiseetchemendypage (+ 14 31) "1.5 Function symbols (optional)")
;; (find-barwiseetchemendypage (+ 14 37) "1.6 The first-order language of set theory (optional)")
;; (find-barwiseetchemendypage (+ 14 38) "1.7 The first-order language of arithmetic (optional)")
;; (find-barwiseetchemendypage (+ 14 40) "1.8 Alternative notation (optional)")
;; (find-barwiseetchemendypage (+ 14 41) "2 The Logic of Atomic Sentences")
;; (find-barwiseetchemendypage (+ 14 41) "2.1 Valid and sound arguments")
;; (find-barwiseetchemendypage (+ 14 46) "2.2 Methods of proof")
;; (find-barwiseetchemendypage (+ 14 54) "2.3 Formal proofs")
;; (find-barwiseetchemendypage (+ 14 58) "2.4 Constructing proofs in Fitch")
;; (find-barwiseetchemendypage (+ 14 63) "2.5 Demonstrating nonconsequence")
;; (find-barwiseetchemendypage (+ 14 66) "2.6 Alternative notation (optional)")
;; (find-barwiseetchemendypage (+ 14 67) "3 The Boolean Connectives")
;; (find-barwiseetchemendypage (+ 14 68) "3.1 Negation symbol: nt")
;; (find-barwiseetchemendypage (+ 14 71) "3.2 Conjunction symbol: and")
;; (find-barwiseetchemendypage (+ 14 74) "3.3 Disjunction symbol: or")
;; (find-barwiseetchemendypage (+ 14 77) "3.4 Remarks about the game")
;; (find-barwiseetchemendypage (+ 14 79) "3.5 Ambiguity and parentheses")
;; (find-barwiseetchemendypage (+ 14 82) "3.6 Equivalent ways of saying things")
;; (find-barwiseetchemendypage (+ 14 84) "3.7 Translation")
;; (find-barwiseetchemendypage (+ 14 89) "3.8 Alternative notation (optional)")
;; (find-barwiseetchemendypage (+ 14 93) "4 The Logic of Boolean Connectives")
;; (find-barwiseetchemendypage (+ 14 94) "4.1 Tautologies and logical truth")
;; (find-barwiseetchemendypage (+ 14 106) "4.2 Logical and tautological equivalence")
;; (find-barwiseetchemendypage (+ 14 110) "4.3 Logical and tautological consequence")
;; (find-barwiseetchemendypage (+ 14 114) "4.4 Tautological consequence in Fitch")
;; (find-barwiseetchemendypage (+ 14 117) "4.5 Pushing negation around (optional)")
;; (find-barwiseetchemendypage (+ 14 121) "4.6 Conjunctive and disjunctive normal forms (optional)")
;; (find-barwiseetchemendypage (+ 14 127) "5 Methods of Proof for Boolean Logic")
;; (find-barwiseetchemendypage (+ 14 128) "5.1 Valid inference steps")
;; (find-barwiseetchemendypage (+ 14 131) "5.2 Proof by cases")
;; (find-barwiseetchemendypage (+ 14 136) "5.3 Indirect proof: proof by contradiction")
;; (find-barwiseetchemendypage (+ 14 140) "5.4 Arguments with inconsistent premises (optional)")
;; (find-barwiseetchemendypage (+ 14 142) "6 Formal Proofs and Boolean Logic")
;; (find-barwiseetchemendypage (+ 14 143) "6.1 Conjunction rules")
;; (find-barwiseetchemendypage (+ 14 148) "6.2 Disjunction rules")
;; (find-barwiseetchemendypage (+ 14 154) "6.3 Negation rules")
;; (find-barwiseetchemendypage (+ 14 163) "6.4 The proper use of subproofs")
;; (find-barwiseetchemendypage (+ 14 167) "6.5 Strategy and tactics")
;; (find-barwiseetchemendypage (+ 14 173) "6.6 Proofs without premises (optional)")
;; (find-barwiseetchemendypage (+ 14 176) "7 Conditionals")
;; (find-barwiseetchemendypage (+ 14 178) "7.1 Material conditional symbol: ->")
;; (find-barwiseetchemendypage (+ 14 181) "7.2 Biconditional symbol: <->")
;; (find-barwiseetchemendypage (+ 14 187) "7.3 Conversational implicature")
;; (find-barwiseetchemendypage (+ 14 190) "7.4 Truth-functional completeness (optional)")
;; (find-barwiseetchemendypage (+ 14 196) "7.5 Alternative notation (optional)")
;; (find-barwiseetchemendypage (+ 14 198) "8 The Logic of Conditionals")
;; (find-barwiseetchemendypage (+ 14 198) "8.1 Informal methods of proof")
;; (find-barwiseetchemendypage (+ 14 206) "8.2 Formal rules of proof for -> and <->")
;; (find-barwiseetchemendypage (+ 14 214) "8.3 Soundness and completeness (optional)")
;; (find-barwiseetchemendypage (+ 14 222) "8.4 Valid arguments: some review exercises")
;; (find-barwiseetchemendypage (+ 14 225) "II Quantifiers")
;; (find-barwiseetchemendypage (+ 14 227) "9 Introduction to Quantification")
;; (find-barwiseetchemendypage (+ 14 228) "9.1 Variables and atomic wffs")
;; (find-barwiseetchemendypage (+ 14 230) "9.2 The quantifier symbols: Fa, Ex")
;; (find-barwiseetchemendypage (+ 14 231) "9.3 Wffs and sentences")
;; (find-barwiseetchemendypage (+ 14 234) "9.4 Semantics for the quantifiers")
;; (find-barwiseetchemendypage (+ 14 239) "9.5 The four Aristotelian forms")
;; (find-barwiseetchemendypage (+ 14 243) "9.6 Translating complex noun phrases")
;; (find-barwiseetchemendypage (+ 14 251) "9.7 Quantifiers and function symbols (optional)")
;; (find-barwiseetchemendypage (+ 14 255) "9.8 Alternative notation (optional)")
;; (find-barwiseetchemendypage (+ 14 257) "10 The Logic of Quantifiers")
;; (find-barwiseetchemendypage (+ 14 257) "10.1 Tautologies and quantification")
;; (find-barwiseetchemendypage (+ 14 266) "10.2 First-order validity and consequence")
;; (find-barwiseetchemendypage (+ 14 275) "10.3 First-order equivalence and DeMorgan s laws")
;; (find-barwiseetchemendypage (+ 14 280) "10.4 Other quantifier equivalences (optional)")
;; (find-barwiseetchemendypage (+ 14 283) "10.5 The axiomatic method (optional)")
;; (find-barwiseetchemendypage (+ 14 289) "11 Multiple Quantifiers")
;; (find-barwiseetchemendypage (+ 14 289) "11.1 Multiple uses of a single quantifier")
;; (find-barwiseetchemendypage (+ 14 285) "2. (Null quantification)")
;; (find-barwiseetchemendytext (+ 14 285) "2. (Null quantification)")
;; (find-barwiseetchemendypage (+ 14 293) "11.2 Mixed quantifiers")
;; (find-barwiseetchemendypage (+ 14 298) "11.3 The step-by-step method of translation")
;; (find-barwiseetchemendypage (+ 14 300) "11.4 Paraphrasing English")
;; (find-barwiseetchemendypage (+ 14 304) "11.5 Ambiguity and context sensitivity")
;; (find-barwiseetchemendypage (+ 14 308) "11.6 Translations using function symbols (optional)")
;; (find-barwiseetchemendypage (+ 14 311) "11.7 Prenex form (optional)")
;; (find-barwiseetchemendypage (+ 14 315) "11.8 Some extra translation problems")
;; (find-barwiseetchemendypage (+ 14 319) "12 Methods of Proof for Quantifiers")
;; (find-barwiseetchemendypage (+ 14 319) "12.1 Valid quantifier steps")
;; (find-barwiseetchemendypage (+ 14 322) "12.2 The method of existential instantiation")
;; (find-barwiseetchemendypage (+ 14 323) "12.3 The method of general conditional proof")
;; (find-barwiseetchemendypage (+ 14 329) "12.4 Proofs involving mixed quantifiers")
;; (find-barwiseetchemendypage (+ 14 338) "12.5 Axiomatizing shape (optional)")
;; (find-barwiseetchemendypage (+ 14 342) "13 Formal Proofs and Quantifiers")
;; (find-barwiseetchemendypage (+ 14 342) "13.1 Universal quantifier rules")
;; (find-barwiseetchemendypage (+ 14 347) "13.2 Existential quantifier rules")
;; (find-barwiseetchemendypage (+ 14 352) "13.3 Strategy and tactics")
;; (find-barwiseetchemendypage (+ 14 361) "13.4 Soundness and completeness (optional)")
;; (find-barwiseetchemendypage (+ 14 361) "13.5 Some review exercises (optional)")
;; (find-barwiseetchemendypage (+ 14 364) "14 More about Quantification (optional)")
;; (find-barwiseetchemendypage (+ 14 366) "14.1 Numerical quantification")
;; (find-barwiseetchemendypage (+ 14 374) "14.2 Proving numerical claims")
;; (find-barwiseetchemendypage (+ 14 379) "14.3 The, both, and neither")
;; (find-barwiseetchemendypage (+ 14 383) "14.4 Adding other determiners to fol")
;; (find-barwiseetchemendypage (+ 14 389) "14.5 The logic of generalized quantification")
;; (find-barwiseetchemendypage (+ 14 397) "14.6 Other expressive limitations of first-order logic")
;; (find-barwiseetchemendypage (+ 14 403) "III Applications and Metatheory")
;; (find-barwiseetchemendypage (+ 14 405) "15 First-order Set Theory")
;; (find-barwiseetchemendypage (+ 14 406) "15.1 Naive set theory")
;; (find-barwiseetchemendypage (+ 14 412) "15.2 Singletons, the empty set, subsets")
;; (find-barwiseetchemendypage (+ 14 415) "15.3 Intersection and union")
;; (find-barwiseetchemendypage (+ 14 419) "15.4 Sets of sets")
;; (find-barwiseetchemendypage (+ 14 422) "15.5 Modeling relations in set theory")
;; (find-barwiseetchemendypage (+ 14 427) "15.6 Functions")
;; (find-barwiseetchemendypage (+ 14 429) "15.7 The powerset of a set (optional)")
;; (find-barwiseetchemendypage (+ 14 432) "15.8 Russell s Paradox (optional)")
;; (find-barwiseetchemendypage (+ 14 433) "15.9 Zermelo Frankel set theory zfc (optional)")
;; (find-barwiseetchemendypage (+ 14 442) "16 Mathematical Induction")
;; (find-barwiseetchemendypage (+ 14 443) "16.1 Inductive definitions and inductive proofs")
;; (find-barwiseetchemendypage (+ 14 451) "16.2 Inductive definitions in set theory")
;; (find-barwiseetchemendypage (+ 14 453) "16.3 Induction on the natural numbers")
;; (find-barwiseetchemendypage (+ 14 456) "16.4 Axiomatizing the natural numbers (optional)")
;; (find-barwiseetchemendypage (+ 14 458) "16.5 Proving programs correct (optional)")
;; (find-barwiseetchemendypage (+ 14 468) "17 Advanced Topics in Propositional Logic")
;; (find-barwiseetchemendypage (+ 14 468) "17.1 Truth assignments and truth tables")
;; (find-barwiseetchemendypage (+ 14 470) "17.2 Completeness for propositional logic")
;; (find-barwiseetchemendypage (+ 14 479) "17.3 Horn sentences (optional)")
;; (find-barwiseetchemendypage (+ 14 488) "17.4 Resolution (optional)")
;; (find-barwiseetchemendypage (+ 14 495) "18 Advanced Topics in FOL")
;; (find-barwiseetchemendypage (+ 14 495) "18.1 First-order structures")
;; (find-barwiseetchemendypage (+ 14 500) "18.2 Truth and satisfaction, revisited")
;; (find-barwiseetchemendypage (+ 14 509) "18.3 Soundness for fol")
;; (find-barwiseetchemendypage (+ 14 512) "18.4 The completeness of the shape axioms (optional)")
;; (find-barwiseetchemendypage (+ 14 514) "18.5 Skolemization (optional)")
;; (find-barwiseetchemendypage (+ 14 516) "18.6 Unification of terms (optional)")
;; (find-barwiseetchemendypage (+ 14 519) "18.7 Resolution, revisited (optional)")
;; (find-barwiseetchemendypage (+ 14 526) "19 Completeness and Incompleteness")
;; (find-barwiseetchemendypage (+ 14 527) "19.1 The Completeness Theorem for fol")
;; (find-barwiseetchemendypage (+ 14 529) "19.2 Adding witnessing constants")
;; (find-barwiseetchemendypage (+ 14 531) "19.3 The Henkin theory")
;; (find-barwiseetchemendypage (+ 14 534) "19.4 The Elimination Theorem")
;; (find-barwiseetchemendypage (+ 14 540) "19.5 The Henkin Construction")
;; (find-barwiseetchemendypage (+ 14 546) "19.6 The Lowenheim-Skolem Theorem")
;; (find-barwiseetchemendypage (+ 14 548) "19.7 The Compactness Theorem")
;; (find-barwiseetchemendypage (+ 14 552) "19.8 The Godel Incompleteness Theorem")
;; (find-barwiseetchemendypage (+ 14 557) "Summary of Formal Proof Rules")
;; (find-barwiseetchemendypage (+ 14 557) "Propositional rules")
;; (find-barwiseetchemendypage (+ 14 559) "First-order rules")
;; (find-barwiseetchemendypage (+ 14 561) "Inference Procedures (Con Rules)")
;; (find-barwiseetchemendypage (+ 14 562) "Glossary")
;; (find-barwiseetchemendypage (+ 14 573) "General Index")
;; (find-barwiseetchemendypage (+ 14 585) "Exercise Files Index")
;; (find-barwiseetchemendypage (+ 14 113) "Tautological consequence")
;; «barwise-moss» (to ".barwise-moss")
;; http://gigapedia.org/items/47442/vicious-circles--center-for-the-study-of-language-and-information---lecture-notes-
(code-djvu "viccircles" "~/books/__logic/barwise_moss__vicious_circles.djvu")
;; (find-viccirclespage 7 "Contents")
;; (find-viccirclespage (+ 10 385) "Index")
;; «beeson-narboux-wiedijk» (to ".beeson-narboux-wiedijk")
;; (find-books "__logic/__logic.el" "beeson-narboux-wiedijk")
(code-pdf-page "prfchkeuc" "~/books/__logic/beeson_narboux_wiedijk__proof-checking_euclid.pdf")
(code-pdf-text "prfchkeuc" "~/books/__logic/beeson_narboux_wiedijk__proof-checking_euclid.pdf" 1)
;; (find-prfchkeucpage)
;; (find-prfchkeucpage 1 "Contents")
;; (find-prfchkeucpage (+ 1 189) "Index")
;; (find-prfchkeuctext "")
;; «bell-machover» (to ".bell-machover")
(code-djvu "bellmachover" "~/books/__logic/bell_machover__a_course_in_mathematical_logic.djvu")
(code-djvutotext "bellmachover" "~/books/__logic/bell_machover__a_course_in_mathematical_logic.djvu")
;; (find-bellmachoverpage 8 "Contents")
;; (find-bellmachoverpage (+ 18 585) "Index")
;; (find-bellmachovertext "")
;; «benthem» (to ".benthem")
;; (find-books "__logic/__logic.el" "benthem")
(code-pdf-page "theageofaltlogs" "~/books/__logic/benthem_heinzmann__the_age_of_alternative_logics.pdf")
(code-pdf-text "theageofaltlogs" "~/books/__logic/benthem_heinzmann__the_age_of_alternative_logics.pdf" 1)
;; (find-theageofaltlogspage)
;; (find-theageofaltlogspage 1 "Contents")
;; (find-theageofaltlogspage (+ -1 167) "in which structures swim")
;; (find-theageofaltlogstext (+ -1 167) "in which structures swim")
;; (find-theageofaltlogspage (+ 1 189) "Index")
;; (find-theageofaltlogstext "")
;; «bernays» (to ".bernays")
(code-djvu "scowbernays" "~/books/__logic/mueller__sets_and_classes_on_the_work_of_paul_bernays.djvu")
;; (find-scowbernayspage 1 "Contents")
;; (find-scowbernayspage (+ 19 1) "1")
;; (find-scowbernayspage (+ 14 353) "Index")
;; «beziau» (to ".beziau")
;; http://gigapedia.com/items/51559/logica-universalis--towards-a-general-theory-of-logic
;; http://gigapedia.com/items/70500/logica-universalis--towards-a-general-theory-of-logic-2nd-ed
(code-xpdf "logicauniversalis" "~/books/__logic/beziau__logica_universalis_towards_a_general_theory_of_logic.pdf")
;; (find-logicauniversalispage 5 "Contents")
;; (find-logicauniversalispage (+ -1 169) "The humbug of many logical values")
;; «bierman-depaiva» (to ".bierman-depaiva")
;; (find-books "__logic/__logic.el" "bierman-depaiva")
(code-pdf-page "biermandepaiva" "~/books/__logic/bierman_depaiva__on_an_intuitionistic_modal_logic.pdf")
(code-pdf-text "biermandepaiva" "~/books/__logic/bierman_depaiva__on_an_intuitionistic_modal_logic.pdf" 1)
;; (find-biermandepaivapage)
;; (find-biermandepaivapage 1 "Contents")
;; (find-biermandepaivapage (+ 1 189) "Index")
;; (find-biermandepaivatext "")
;; «birkedal» (to ".birkedal")
;; https://arxiv.org/abs/2010.13926
;; https://arxiv.org/pdf/2010.13926.pdf
;; Qian/Kavvos/Birkedal: "Client-Server Sessions in Linear Logic"
(code-pdf-page "clislll" "$S/https/arxiv.org/pdf/2010.13926.pdf")
(code-pdf-text "clislll" "$S/https/arxiv.org/pdf/2010.13926.pdf")
;; (find-clislllpage)
;; (find-clisllltext)
;; «blok-pigozzi» (to ".blok-pigozzi")
;; (find-books "__logic/__logic.el" "blok-pigozzi")
(code-pdf "blokpig" "~/books/__logic/blok_pigozzi__algebraizable_logics.pdf")
(code-pdftotext "blokpig" "~/books/__logic/blok_pigozzi__algebraizable_logics.pdf" 1)
;; (find-blokpigpage)
;; (find-blokpigpage 1 "Contents")
;; (find-blokpigpage (+ 1 189) "Index")
;; (find-blokpigtext "")
;; «brown» (to ".brown")
;; (find-books "__logic/__logic.el" "brown")
;; (find-books "__logic/__logic.el" "brown" "proofsandpictures")
;; James Robert Brown: "Proofs and Pictures"
;; http://jwood.faculty.unlv.edu/unlv/Articles/Brown.pdf
;; (find-fline "$S/http/jwood.faculty.unlv.edu/unlv/Articles/")
(code-xpdf "proofsandpictures" "$S/http/jwood.faculty.unlv.edu/unlv/Articles/Brown.pdf")
(code-pdf-text "proofsandpictures" "$S/http/jwood.faculty.unlv.edu/unlv/Articles/Brown.pdf" -160)
;; (find-proofsandpicturespage)
;; (find-proofsandpicturestext)
;; (find-proofsandpicturespage (+ -160 161) "1 Bolzano's")
;; (find-proofsandpicturestext (+ -160 161) "1 Bolzano's")
;; (find-proofsandpicturespage (+ -160 174) "7 A Kantian objection")
;; (find-proofsandpicturestext (+ -160 174) "7 A Kantian objection")
;; «debruijn» (to ".debruijn")
;; (find-books "__logic/__logic.el" "debruijn")
;;
;; «debruijn-telesc» (to ".debruijn-telesc")
;; (find-books "__logic/__logic.el" "debruijn-telesc")
;; https://doi.org/10.1016/0890-5401(91)90066-B
;; https://dl.acm.org/doi/abs/10.1016/0890-5401%2891%2990066-b
(code-pdf-page "debruijntmintlc" "~/books/__logic/de_bruijn__telescopic_mappings_in_typed_lambda_calculus.pdf")
(code-pdf-text "debruijntmintlc" "~/books/__logic/de_bruijn__telescopic_mappings_in_typed_lambda_calculus.pdf" 1)
;; (find-debruijntmintlcpage)
;; (find-debruijntmintlcpage 1 "Contents")
;; (find-debruijntmintlcpage (+ 1 189) "Index")
;; (find-debruijntmintlctext "")
;; «bueno» (to ".bueno")
;; (find-books "__logic/__logic.el" "bueno")
;; https://link.springer.com/article/10.1007/s10516-010-9101-4
(code-pdf-page "bueno2ndorder" "~/books/__logic/bueno__a_defense_of_second-order_logic.pdf")
(code-pdf-text "bueno2ndorder" "~/books/__logic/bueno__a_defense_of_second-order_logic.pdf" 1)
;; (find-bueno2ndorderpage)
;; (find-bueno2ndorderpage 1 "Contents")
;; (find-bueno2ndorderpage (+ 1 189) "Index")
;; (find-bueno2ndordertext "")
;; «bunder-seldin» (to ".bunder-seldin")
;; (find-books "__logic/__logic.el" "bunder-seldin")
;; http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.88.9497
;; Bunder/Seldin: Variants of the Basic Calculus of Constructions
(code-pdf-page "bunderseldin" "~/books/__logic/bunder_seldin__variants_of_the_basic_calculus_of_constructions.pdf")
(code-pdf-text "bunderseldin" "~/books/__logic/bunder_seldin__variants_of_the_basic_calculus_of_constructions.pdf" 1)
;; (find-bunderseldinpage)
;; (find-bunderseldinpage 1 "Contents")
;; (find-bunderseldinpage (+ 1 189) "Index")
;; (find-bunderseldintext "")
;; «carnap» (to ".carnap")
(code-djvu "carnapprob" "~/books/__logic/carnap__logical_foundations_of_probability.djvu")
(code-djvutotext "carnapprob" "~/books/__logic/carnap__logical_foundations_of_probability.djvu" 25)
;; (find-carnapprobpage)
;; (find-carnapprobpage 21 "Contents")
;; (find-carnapprobpage (+ 17 605) "Index")
;; (find-carnapprobtext "")
;; «carnielli» (to ".carnielli")
;; «carnielli-coniglio» (to ".carnielli-coniglio")
;; (find-books "__logic/__logic.el" "carnielli-coniglio")
;; (find-books "__logic/__logic.el" "carnielli")
(code-pdf "cacoparalococo" "~/books/__logic/carnielli_coniglio__paraconsistent_logic_consistency_contradiction_and_negation.pdf")
(code-pdftotext "cacoparalococo" "~/books/__logic/carnielli_coniglio__paraconsistent_logic_consistency_contradiction_and_negation.pdf" 23)
;; (find-cacoparalococopage)
;; (find-cacoparalococopage 20 "Contents")
;; (find-cacoparalococopage (+ 19 391) "Index")
;; (find-cacoparalococotext "")
(code-pdf-page "cacoasl" "~/books/__logic/carnielli_coniglio_et_al__analysis_and_synthesis_of_logics_how_to_cut_and_paste_reasoning_systems.pdf")
(code-pdf-text "cacoasl" "~/books/__logic/carnielli_coniglio_et_al__analysis_and_synthesis_of_logics_how_to_cut_and_paste_reasoning_systems.pdf" 16)
;; (find-cacoaslpage)
;; (find-cacoaslpage 6 "Contents")
;; (find-cacoaslpage (+ 12 579) "Subject Index")
;; (find-cacoasltext "")
;; "Paraconsistent set theory by predicating on consistency"
;; http://www.cle.unicamp.br/prof/coniglio/Carnielli-Coniglio-ParST.pdf
(code-pdf-page "cacoparst" "$S/http/www.cle.unicamp.br/prof/coniglio/Carnielli-Coniglio-ParST.pdf")
(code-pdf-text "cacoparst" "$S/http/www.cle.unicamp.br/prof/coniglio/Carnielli-Coniglio-ParST.pdf")
;; (find-cacoparstpage)
;; (find-cacoparsttext)
;; «chagrov» (to ".chagrov")
;; (find-books "__logic/__logic.el" "chagrov")
;; (find-LATEX "catsem-u.bib" "bib-ChagrovZakharyaschev")
(code-pdf-page "chagrovzml" "~/books/__logic/chagrov_zakharyaschev__modal_logic.pdf")
(code-pdf-text "chagrovzml" "~/books/__logic/chagrov_zakharyaschev__modal_logic.pdf" 15)
;; (find-chagrovzmlpage)
;; (find-chagrovzmlpage 11 "Contents")
;; (find-chagrovzmlpage (+ 15 109) "4.1. Superintuitionistic logics")
;; (find-chagrovzmlpage (+ 15 112) "BW_n")
;; (find-chagrovzmlpage (+ 6 597) "Index")
;; (find-chagrovzmltext "")
;; «changkeisler» (to ".changkeisler")
;; http://gigapedia.com/items/155775/model-theory--studies-in-logic-and-the-foundations-of-mathematics-
(code-djvu "changkeisler" "~/books/__logic/chang_keisler__model_theory.djvu")
;; (find-changkeislerpage 1 "Contents")
;; (find-changkeislerpage (+ 1 1) "Index")
;; «chew» (to ".chew")
;; Xuanyi Chew: "Closure Calculus is Better than the Pure lambda-Calculus"
;; https://blog.chewxy.com/
;; https://blog.chewxy.com/wp-content/uploads/personal/dissertation31482.pdf
;; (find-fline "$S/https/blog.chewxy.com/wp-content/uploads/personal/")
(code-pdf-page "chew" "$S/https/blog.chewxy.com/wp-content/uploads/personal/dissertation31482.pdf")
(code-pdf-text "chew" "$S/https/blog.chewxy.com/wp-content/uploads/personal/dissertation31482.pdf" 1)
;; (find-chewpage)
;; (find-chewtext)
;; (find-chewpage 2 "Contents")
;; (find-chewtext 2 "Contents")
;; (find-chewpage (+ 1 5) "Introduction")
;; (find-chewtext (+ 1 5) "Introduction")
;; «chuaqui» (to ".chuaqui")
(code-djvu "chuaqui" "~/books/__logic/chuaqui__axiomatic_set_theory.djvu")
;; (find-chuaquipage 1 "Contents")
;; (find-chuaquipage (+ 1 1) "Index")
;; «ciabattoni-ferrari» (to ".ciabattoni-ferrari")
;; (find-books "__logic/__logic.el" "ciabattoni-ferrari")
;; Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models
;; https://academic.oup.com/logcom/article-abstract/11/2/283/936181
;; https://doi.org/10.1093/logcom/11.2.283
;; https://www.logic.at/staff/agata/publications.html
;; https://www.logic.at/staff/agata/jlc2000.pdf
;; (find-fline "$S/https/www.logic.at/staff/agata/")
(code-pdf-page "boundedkripkemodels" "$S/https/www.logic.at/staff/agata/jlc2000.pdf")
(code-pdf-text "boundedkripkemodels" "$S/https/www.logic.at/staff/agata/jlc2000.pdf")
;; (find-boundedkripkemodelspage)
;; (find-boundedkripkemodelstext)
;; (find-boundedkripkemodelspage 5 "3 Logics of Bounded Width Kripke Models")
;; (find-boundedkripkemodelstext 5 "3 Logics of Bounded Width Kripke Models")
;; «coniglio» (to ".coniglio")
;; Coniglio: "Recovering a logic from its fragments by meta-fibring"
;; http://www.cle.unicamp.br/prof/coniglio/CombSEQ-final.pdf
;; «conway» (to ".conway")
;; http://gigapedia.com/items/67259/on-numbers-and-games--l-m-s--monographs---no--6-
;; http://gigapedia.com/items/20515/the-book-of-numbers
(code-djvu "onag" "~/books/__logic/conway__on_numbers_and_games.djvu")
(code-djvu "bookofnumbers" "~/books/__logic/conway_guy__the_book_of_numbers.djvu")
;; (find-onagpage 9 "Contents")
;; (find-onagpage (+ 5 231) "Index")
;; (find-bookofnumberspage 6 "Contents")
;; (find-bookofnumberspage 301 "Index")
;; «copi» (to ".copi")
;; (find-books "__logic/__logic.el" "copi")
(code-djvu "copipt" "~/books/__logic/copi__introducao_a_logica.djvu")
(code-djvutotext "copipt" "~/books/__logic/copi__introducao_a_logica.djvu" 1)
;; (find-copiptpage)
;; (find-copiptpage 1 "Contents")
;; (find-copiptpage (+ 3 477) "Index")
;; (find-copipttext "")
(code-pdf "copien" "~/books/__logic/copi__introduction_to_logic.pdf")
(code-pdftotext "copien" "~/books/__logic/copi__introduction_to_logic.pdf" 1)
;; (find-copienpage)
;; (find-copienpage 1 "Contents")
;; (find-copienpage (+ 1 189) "Index")
;; (find-copientext "")
;; «coquand» (to ".coquand")
;; (find-books "__logic/__logic.el" "coquand")
;; "A New Paradox in Type Theory" (1994)
;; http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.4920
(code-pdf-page "coquandnptt" "~/books/__logic/coquand__a_new_paradox_in_type_theory.pdf")
(code-pdf-text "coquandnptt" "~/books/__logic/coquand__a_new_paradox_in_type_theory.pdf" 1)
;; (find-coquandnpttpage)
;; (find-coquandnpttpage 1 "Contents")
;; (find-coquandnpttpage (+ 1 189) "Index")
;; (find-coquandnptttext "")
;; «coquand-huet» (to ".coquand-huet")
;; (find-books "__logic/__logic.el" "coquand-huet")
;; Coquand/Huet: "The Calculus of Constructions"
;; Information and Computation 76, 95-120 (1988)
;; https://core.ac.uk/download/pdf/82038778.pdf
;; (find-fline "$S/https/core.ac.uk/download/pdf/")
(code-pdf-page "coquandhuet" "$S/https/core.ac.uk/download/pdf/82038778.pdf")
(code-pdf-text "coquandhuet" "$S/https/core.ac.uk/download/pdf/82038778.pdf" -94)
;; (find-coquandhuetpage)
;; (find-coquandhuettext)
;; (find-coquandhuetpage (+ -94 95) "1. THE ABSTRACT" "SYNTAX OF TERMS")
;; (find-coquandhuettext (+ -94 95) "1. THE ABSTRACT" "SYNTAX OF TERMS")
;; (find-coquandhuetpage (+ -94 98) "2. A FIRST ATTEMPT" "AT A CONSTRUCTION" "CALCULUS")
;; (find-coquandhuettext (+ -94 98) "2. A FIRST ATTEMPT" "AT A CONSTRUCTION" "CALCULUS")
;; (find-coquandhuetpage (+ -94 101) "3. THE CALCULUS WITH CONVERSION RULES")
;; (find-coquandhuettext (+ -94 101) "3. THE CALCULUS WITH CONVERSION RULES")
;; (find-coquandhuetpage (+ -94 105) "4." "STRIPPING")
;; (find-coquandhuettext (+ -94 105) "4." "STRIPPING")
;; (find-coquandhuetpage (+ -94 107) "5. AN INTERPRETATION" "OF CONSTRUCTIONS")
;; (find-coquandhuettext (+ -94 107) "5. AN INTERPRETATION" "OF CONSTRUCTIONS")
;; (find-coquandhuetpage (+ -94 111) "6. VARIATIONS" "ON THE BASIC CALCULUS")
;; (find-coquandhuettext (+ -94 111) "6. VARIATIONS" "ON THE BASIC CALCULUS")
;; (find-coquandhuetpage (+ -94 113) "7. TOWARDS" "A REASONABLE" "USER INTERFACE")
;; (find-coquandhuettext (+ -94 113) "7. TOWARDS" "A REASONABLE" "USER INTERFACE")
;; (find-coquandhuetpage (+ -94 113) "7.1. Introducing Constants")
;; (find-coquandhuettext (+ -94 113) "7.1. Introducing Constants")
;; (find-coquandhuetpage (+ -94 113) "7.2. Synthesis of Implicit Arguments")
;; (find-coquandhuettext (+ -94 113) "7.2. Synthesis of Implicit Arguments")
;; (find-coquandhuetpage (+ -94 116) "8. POSSIBLE EXTENSTIONS")
;; (find-coquandhuettext (+ -94 116) "8. POSSIBLE EXTENSTIONS")
;; «corcoran» (to ".corcoran")
;; (find-books "__logic/__logic.el" "corcoran")
;; John Corcoran: "Aristotle's Prototype Rule-Based Underlying Logic" (LU, 2018)
;; https://doi.org/10.1007/s11787-018-0189-4
(code-pdf-page "corcoran2018" "~/books/__logic/corcoran2018.pdf")
(code-pdf-text "corcoran2018" "~/books/__logic/corcoran2018.pdf" 1)
;; (find-corcoran2018page)
;; (find-corcoran2018page 1 "Contents")
;; (find-corcoran2018page (+ 1 189) "Index")
;; (find-corcoran2018text "")
;; «corcoran-alaimi» (to ".corcoran-alaimi")
;; John Corcoran (ed.): "Ancient Logic and Its Modern Interpretations" (1974)
;; https://philarchive.org/rec/CORALA
;; https://philarchive.org/archive/CORALA
;; (find-fline "$S/https/philarchive.org/archive/")
(code-pdf-page "alaimi" "$S/https/philarchive.org/archive/CORALA")
(code-pdf-text "alaimi" "$S/https/philarchive.org/archive/CORALA" 8)
;; (find-alaimipage)
;; (find-alaimitext)
;; (find-alaimipage (+ 8 3) "Norman Kretzmann / Aristotle on Spoken Sound Signi1icant by Convention")
;; (find-alaimipage (+ 7 23) "Ronald Zirin / Inarticulate Noises")
;; (find-alaimipage (+ 6 27) "Newton Garver / Notes for a Linguistic Reading of the Categories")
;; (find-alaimipage (+ 5 35) "Ian Mueller / Greek Mathematics and Greek Logic")
;; (find-alaimipage (+ 5 71) "John Mulhern / Modem Notations and Ancient Logic")
;; (find-alaimipage (+ 4 85) "John Corcoran / Aristotle's Natural Deduction System")
;; (find-alaimipage (+ 3 133) "Mary Mulhern / Corcoran on Aristotle's Logical Theory")
;; (find-alaimipage (+ 2 151) "Josiah Gould / Deduction in Stoic Logic")
;; (find-alaimipage (+ 2 169) "John Corcoran / Remarks on Stoic Deduction")
;; (find-alaimipage (+ 0 185) "John Corcoran / Future Research on Ancient Theories or Communication and Reasoning")
;; (find-alaimipage (+ -1 189) "A Panel Discussion on Future Research in Ancient Logical Theory")
;; (find-alaimipage (+ -1 209) "INDEX OF NAMES")
;; John Corcoran: "Aristotle's Natural Deduction System" (1974)
;; https://philarchive.org/rec/CORAND
;; https://philarchive.org/archive/CORAND
(code-pdf-page "corcoranands" "$S/https/philarchive.org/archive/CORAND")
(code-pdf-text "corcoranands" "$S/https/philarchive.org/archive/CORAND")
;; (find-corcoranandspage)
;; (find-corcoranandstext)
;; «crossley-dummett» (to ".crossley-dummett")
;; (find-books "__logic/__logic.el" "crossley-dummett")
(code-pdf-page "formalsrfp" "~/books/__logic/crossley_dummett__formal_systems_and_recursive_functions_proceedings_of_the_eighth_logic_colloquium_oxford_july_1963.pdf")
(code-pdf-text "formalsrfp" "~/books/__logic/crossley_dummett__formal_systems_and_recursive_functions_proceedings_of_the_eighth_logic_colloquium_oxford_july_1963.pdf" 3)
;; (find-formalsrfppage)
;; (find-formalsrfppage 1 "Contents")
;; (find-formalsrfppage (+ 3 92) "SEMANTICAL ANALYSIS OF INTUITIONISTIC LOGIC I")
;; (find-formalsrfptext (+ 3 92) "SEMANTICAL ANALYSIS OF INTUITIONISTIC LOGIC I")
;; (find-formalsrfppage (+ 3 92) "KRIPKE")
;; (find-formalsrfptext (+ 3 92) "KRIPKE")
;; (find-formalsrfppage (+ 1 304) "Wang")
;; (find-formalsrfptext "")
;; «curry» (to ".curry")
;; http://gigapedia.com/items/126830/foundations-of-mathematical-logic
;; http://gigapedia.com/items/259486/combinatory-logic--volumes-i-and-ii--studies-in-logic-and-the-foundations-of-mathematics-
(code-djvu "curryfound" "~/books/__logic/curry__foundations_of_mathematical_logic.djvu")
;; (find-curryfoundpage 7 "Contents")
;; (find-curryfoundpage (+ 9 391) "Index")
(code-djvu "curryfeys1" "~/books/__logic/curry_feys__combinatory_logic_vol_1.djvu")
;; (find-curryfeys1page 1 "Contents")
;; (find-curryfeys1page (+ 7 397) "Index")
;; «dagostino» (to ".dagostino")
;; (find-books "__logic/__logic.el" "dagostino")
;; https://www.researchgate.net/publication/221350906_Classical_Natural_Deduction
(code-pdf-page "dagostinocnd" "~/books/__logic/dagostino__classical_natural_deduction.pdf")
(code-pdf-text "dagostinocnd" "~/books/__logic/dagostino__classical_natural_deduction.pdf" -427)
;; (find-dagostinocndpage)
;; (find-dagostinocndtext)
;; (find-dagostinocndpage (+ -427 429) "1 Introduction")
;; (find-dagostinocndtext (+ -427 429) "1 Introduction")
;; (find-dagostinocndpage (+ -427 438) "non-intuitionistic de Morgan law")
;; (find-dagostinocndtext (+ -427 438) "non-intuitionistic de Morgan law")
;; (find-dagostinocndpage (+ -427 439) "A tableau proof of the non-intuitionistic de Morgan Law")
;; (find-dagostinocndtext (+ -427 439) "A tableau proof of the non-intuitionistic de Morgan Law")
;; (find-dagostinocndtext "")
;; «damas» (to ".damas")
;; (find-books "__logic/__logic.el" "damas")
;; Luis Damas: "Type Assignment in Programming Languages" (PhD Thesis, 1984)
;; http://prl.ccs.neu.edu/img/d-thesis-1984.pdf
;; (find-fline "$S/http/prl.ccs.neu.edu/img/")
(code-pdf-page "damasphd" "$S/http/prl.ccs.neu.edu/img/d-thesis-1984.pdf")
(code-pdf-text "damasphd" "$S/http/prl.ccs.neu.edu/img/d-thesis-1984.pdf" 6)
;; (find-damasphdpage)
;; (find-damasphdtext)
;; (find-damasphdpage 5 "Table of Contents")
;; (find-damasphdtext 5 "Table of Contents")
;; (find-damasphdpage (+ 6 1) "Introduction")
;; (find-damasphdpage (+ 7 14) "1. A type inference system for an applicative language")
;; (find-damasphdpage (+ 7 14) "1.1. Introduction")
;; (find-damasphdpage (+ 7 16) "1.2. Expressions")
;; (find-damasphdpage (+ 7 18) "1.3. Types")
;; (find-damasphdpage (+ 7 20) "1.4. Semantics")
;; (find-damasphdpage (+ 7 26) "1.5. Type inference")
;; (find-damasphdpage (+ 7 35) "1.6. A type assignment algorithm")
;; (find-damasphdpage (+ 7 42) "1.7. Principal types and completeness of T")
;; (find-damasphdpage (+ 7 48) "1.8. Type schemes, assumption schemes and type inference")
;; (find-damasphdpage (+ 7 59) "1.9. Type assignment and overloading")
;; (find-damasphdpage (+ 8 65) "2. A type scheme inference system")
;; (find-damasphdpage (+ 8 65) "2.1. Introduction")
;; (find-damasphdpage (+ 8 66) "2.2. Preliminaries")
;; (find-damasphdpage (+ 8 68) "2.3. Type inference")
;; (find-damasphdpage (+ 8 72) "2.4. The type assignment algorithm W")
;; (find-damasphdpage (+ 8 74) "2.5. The completeness of W and principal type schemes")
;; (find-damasphdpage (+ 8 84) "2.6. Comparison with the inference system of chapter I")
;; (find-damasphdpage (+ 9 88) "3. References to a store and type inference")
;; (find-damasphdpage (+ 9 88) "3.1. Introduction")
;; (find-damasphdpage (+ 9 92) "3.2. The language and its semantics")
;; (find-damasphdpage (+ 9 94) "3.3. Types, type schemes and their semantics")
;; (find-damasphdpage (+ 9 107) "3.4. Type inference")
;; (find-damasphdpage (+ 9 115) "3.5. A type assignment algorithm")
;; (find-damasphdpage (+ 9 118) "3.6. Weak polymorphism and programming examples")
;; (find-damasphdpage (+ 10 124) "4. Conclusions and directions for further research")
;; (find-damasphdpage (+ 10 127) "References")
;; «davis» (to ".davis")
;; http://gigapedia.com/items/135960/engines-of-logic--or-the-universal-computer---mathematicians-and-the-origin-of-the-computer
(code-djvu "enginesoflogic" "~/books/__logic/davis__engines_of_logic.djvu")
;; (find-enginesoflogicpage 6 "Contents")
;; (find-enginesoflogicpage (+ 11 249) "Index")
;; «degroote-hindley» (to ".degroote-hindley")
;; http://gigapedia.com/items/114823/typed-lambda-calculi-and-applications--third-international-conference-on-typed-lambda-calculi-and-applications--tlca---039-97--nancy--france--april-2-4--1997-------lecture-notes-in-computer-science-
(code-xpdf "tlca97" "~/books/__logic/de_groote_hindley__tlca_97.pdf")
;; (find-tlca97page 6 "Contents")
;; (find-tlca97page (+ 7 82) "Torben Brauner" "A simple adequate categorical model for PCF")
;; (find-tlca97page (+ 7 164) "Neil Ghani" "Eta-expansions in Dependent Type Theory")
;; (find-tlca97page (+ 7 181) "Martini/Masini")
;; (find-tlca97page (+ 7 354) "Takeuti, Izumi" "An Axiomatic System of Parametricity")
;; (find-tlca97page (+ 7 373) "Urzyczyn")
;; «devlin» (to ".devlin")
;; http://gigapedia.com/items/119048/the-joy-of-sets--fundamentals-of-contemporary-set-theory--undergraduate-texts-in-mathematics---second-edition
(code-djvu "devlin" "~/books/__logic/devlin__the_joy_of_sets.djvu")
;; (find-devlinpage 10 "Contents")
;; (find-devlinpage (+ 11 189) "Index")
;; «dore» (to ".dore")
;; (find-books "__logic/__logic.el" "dore")
;; Maximilian Doré: "Constructivity in Homotopy Type Theory"
;; https://www.cs.ox.ac.uk/people/maximilian.dore/master.pdf
(code-pdf-page "dore" "$S/https/www.cs.ox.ac.uk/people/maximilian.dore/master.pdf")
(code-pdf-text "dore" "$S/https/www.cs.ox.ac.uk/people/maximilian.dore/master.pdf")
;; (find-dorepage)
;; (find-doretext)
;; (find-dorepage (+ 3 2) "constructivity in the \"algorithmic\" sense")
;; (find-doretext (+ 3 2) "constructivity in the \"algorithmic\" sense")
;; (find-dorepage (+ 3 2) "\"intuitionistic\" sense")
;; (find-doretext (+ 3 2) "\"intuitionistic\" sense")
;; «dummett» (to ".dummett")
;; (find-books "__logic/__logic.el" "dummett")
;; (find-LATEX "catsem-u.bib" "bib-Dummett")
(code-pdf-page "dummettei" "~/books/__logic/dummett__elements_of_intuitionism_2nd_ed.pdf")
(code-pdf-text "dummettei" "~/books/__logic/dummett__elements_of_intuitionism_2nd_ed.pdf" 14)
;; (find-dummetteipage)
;; (find-dummetteipage 13 "Contents")
;; (find-dummetteipage (+ 14 1) "Introductory remarks")
;; (find-dummetteipage (+ 14 6) "1. Preliminaries")
;; (find-dummetteipage (+ 14 8) "1.2. The meaning of the logical constants")
;; (find-dummetteipage (+ 14 14) "Domains of quantification")
;; (find-dummetteipage (+ 14 21) "1.4." "Rieger-Nishimura")
;; (find-dummetteipage (+ 14 88) "4. The formalization of intuitionistic logic")
;; (find-dummetteipage (+ 14 88) "4.1. Natural Deduction")
;; (find-dummetteipage (+ 14 89) "logical rules")
;; (find-dummetteipage (+ 14 96) "4.2. The sequent calculus")
;; (find-dummetteipage (+ 14 328) "Index")
;; (find-dummetteitext "")
;; «ebbinghaus» (to ".ebbinghaus")
;; (find-books "__logic/__logic.el" "ebbinghaus")
(code-pdf-page "ebbinghaus" "~/books/__logic/ebbinghaus__mathematical_logic.pdf")
(code-pdf-text "ebbinghaus" "~/books/__logic/ebbinghaus__mathematical_logic.pdf" 9)
(find-pdf-page "~/books/__logic/ebbinghaus__mathematical_logic_lista02.pdf" 1)
;; (find-ebbinghauspage)
;; (find-ebbinghauspage 7 "Contents")
;; (find-ebbinghauspage (+ 9 3) "1. Introduction")
;; (find-ebbinghauspage (+ 7 27) "3. Semantics of first-order languages")
;; (find-ebbinghauspage (+ -1 283) "Index")
;; (find-ebbinghaustext "")
;; «enderton» (to ".enderton")
;; http://www.math.ucla.edu/~hbe/amil/
;; http://gigapedia.com/items/35707/a-mathematical-introduction-to-logic--2nd-edition
;; http://gigapedia.com/items/10671/elements-of-set-theory
(code-djvu "enderton" "~/books/__logic/enderton__a_mathematical_introduction_to_logic.djvu")
(code-djvu "endertonst" "~/books/__logic/enderton__elements_of_set_theory.djvu")
;; (find-endertonpage 4 "Contents")
;; (find-endertonpage (+ 9 311) "Index")
;; (find-endertonstpage 4 "Contents")
;; (find-endertonstpage (+ 10 273) "Index")
;; «farmer» (to ".farmer")
;; (find-books "__logic/__logic.el" "farmer")
;; (find-angg ".emacs.papers" "farmer")
;; «farmer-chiron» (to ".farmer-chiron")
;; (find-books "__logic/__logic.el" "farmer-chiron")
;; Chiron: A Set Theory with Types, Undefinedness, Quotation, and Evaluation
;; https://arxiv.org/abs/1305.6206
;; https://arxiv.org/pdf/1305.6206.pdf
(code-pdf-page "farmerchiron" "$S/https/arxiv.org/pdf/1305.6206.pdf")
(code-pdf-text "farmerchiron" "$S/https/arxiv.org/pdf/1305.6206.pdf")
;; (find-farmerchironpage)
;; (find-farmerchirontext)
;; «feferman» (to ".feferman")
;; (find-books "__logic/__logic.el" "feferman")
;; https://link.springer.com/article/10.1007/s11229-011-9985-6
(code-pdf-page "andsoon" "~/books/__logic/feferman__and_so_on_reasoning_with_infinite_diagrams.pdf")
(code-pdf-text "andsoon" "~/books/__logic/feferman__and_so_on_reasoning_with_infinite_diagrams.pdf" -370)
;; (find-andsoonpage)
;; (find-andsoontext "")
;; (find-andsoonpage (+ -370 381) "Jamnik")
;; (find-andsoontext (+ -370 381) "Jamnik")
;; «fenstadt» (to ".fenstadt")
;; http://gigapedia.com/items/124942/introduction-to-metamathematics--bibliotheca-mathematica---bibliotheca-mathematica-
;; http://gigapedia.com/items/259363/proceedings-of-the-second-scandinavian-logic-symposium--studies-in-logic-and-the-foundations-of-mathematics-
(code-xpdf "2ndscandlogsymp" "~/books/__logic/fenstad_ed__proceedings_of_the_second_scandinavian_logic_symposium.pdf")
;; (find-2ndscandlogsymppage (+ 4 1) "On the decision problems...")
;; (find-2ndscandlogsymppage (+ 1 1) "Index")
;; (find-2ndscandlogsymppage (+ 3 63) "Girard")
;; (find-2ndscandlogsymppage (+ 3 179) "Martin-Löf")
;; (find-2ndscandlogsymppage (+ 2 217) "Martin-Löf")
;; (find-2ndscandlogsymppage (+ 1 235) "Prawitz")
;; (find-2ndscandlogsymppage (+ 0 309) "Quine")
;; (find-2ndscandlogsymppage (+ -2 369) "Troelstra")
;; «ferreira» (to ".ferreira")
;; (find-books "__logic/__logic.el" "ferreira")
;; https://mail.google.com/mail/u/0/#inbox/FMfcgzGwJckHGQWmzRFJhgVVLXRTQChS
;; https://langsci-press.org/catalog/book/200 Curso de semântica formal - Marcelo Ferreira
(code-pdf-page "semfor" "~/books/__logic/ferreira__curso_de_semantica_formal.pdf")
(code-pdf-text "semfor" "~/books/__logic/ferreira__curso_de_semantica_formal.pdf" 14)
;; (find-semforpage)
;; (find-semforpage 5 "Sumário")
;; (find-semforpage (+ 1 189) "Index")
;; (find-semfortext "")
;; (find-semforpage (+ 14 1) "1 Significado e condições de verdade")
;; (find-semforpage (+ 14 1) "1.1 Significado, verdade e mundo")
;; (find-semforpage (+ 14 3) "1.2 Relações semânticas entre sentenças")
;; (find-semforpage (+ 14 5) "1.3 Composicionalidade")
;; (find-semforpage (+ 14 9) "1.4 Linguagem objeto e metalinguagem")
;; (find-semforpage (+ 14 10) "1.5 Extensões")
;; (find-semforpage (+ 14 18) "1.6 Além de extensões e condições de verdade")
;; (find-semforpage (+ 14 22) "Sugestões de leitura")
;; (find-semforpage (+ 14 23) "Exercícios")
;; (find-semforpage (+ 14 27) "2 Predicação")
;; (find-semforpage (+ 14 27) "2.1 Funções e a notação lambda")
;; (find-semforpage (+ 14 27) "2.1.1 Funções")
;; (find-semforpage (+ 14 29) "2.1.2 Conjuntos e funções características")
;; (find-semforpage (+ 14 31) "2.1.3 Funções, conjuntos e predicados")
;; (find-semforpage (+ 14 31) "2.2 Verbos intransitivos e aplicação funcional")
;; (find-semforpage (+ 14 34) "2.3 Verbos transitivos")
;; (find-semforpage (+ 14 37) "2.4 Tipos e domínios semânticos")
;; (find-semforpage (+ 14 39) "2.5 Verbos bitransitivos")
;; (find-semforpage (+ 14 41) "2.6 Predicados não verbais")
;; (find-semforpage (+ 14 45) "2.7 Relações, funções e currying")
;; (find-semforpage (+ 14 47) "Apêndice: mais sobre conversões lambda e alfa")
;; (find-semforpage (+ 14 51) "Sugestões de leitura")
;; (find-semforpage (+ 14 51) "Exercícios")
;; (find-semforpage (+ 14 55) "3 Coordenação e negação")
;; (find-semforpage (+ 14 55) "3.1 Coordenação")
;; (find-semforpage (+ 14 59) "3.2 A flexibilidade da coordenação")
;; (find-semforpage (+ 14 66) "3.3 Negação")
;; (find-semforpage (+ 14 71) "Sugestões de leitura")
;; (find-semforpage (+ 14 71) "Exercícios")
;; (find-semforpage (+ 14 75) "4 Referência")
;; (find-semforpage (+ 14 75) "4.1 Descrições definidas")
;; (find-semforpage (+ 14 77) "4.1.1 Unicidade")
;; (find-semforpage (+ 14 80) "4.2 Nomes próprios")
;; (find-semforpage (+ 14 83) "4.2.1 Nomes próprios como predicados")
;; (find-semforpage (+ 14 86) "4.3 Pronomes")
;; (find-semforpage (+ 14 93) "Sugestões de leitura")
;; (find-semforpage (+ 14 93) "Exercícios")
;; (find-semforpage (+ 14 97) "5 Modificação nominal")
;; (find-semforpage (+ 14 97) "5.1 Modificadores nominais")
;; (find-semforpage (+ 14 98) "5.2 Sintagmas adjetivais")
;; (find-semforpage (+ 14 101) "5.3 Mudança de tipos")
;; (find-semforpage (+ 14 103) "5.4 Conjunção funcional")
;; (find-semforpage (+ 14 105) "5.5 Modificação e classes de comparação")
;; (find-semforpage (+ 14 107) "5.6 Orações relativas")
;; (find-semforpage (+ 14 113) "5.6.1 Vestígios e movimento sintático")
;; (find-semforpage (+ 14 116) "Sugestões de leitura")
;; (find-semforpage (+ 14 117) "Exercícios")
;; (find-semforpage (+ 14 119) "6 Quantificação nominal")
;; (find-semforpage (+ 14 119) "6.1 Expressões quantificadoras e indivíduos")
;; (find-semforpage (+ 14 122) "6.2 Quantificadores generalizados")
;; (find-semforpage (+ 14 124) "6.3 Determinantes quantificadores")
;; (find-semforpage (+ 14 128) "6.4 De volta aos nomes próprios e às descrições definidas")
;; (find-semforpage (+ 14 130) "6.5 Outros DPs quantificadores")
;; (find-semforpage (+ 14 133) "6.6 Coordenação de DPs")
;; (find-semforpage (+ 14 137) "6.7 Conservatividade: um universal semântico")
;; (find-semforpage (+ 14 143) "6.8 Quantificação e escopo")
;; (find-semforpage (+ 14 143) "6.8.1 DPs quantificadores em posição de objeto")
;; (find-semforpage (+ 14 144) "6.8.2 Interação de escopo entre DPs")
;; (find-semforpage (+ 14 145) "6.8.3 Negação e escopo")
;; (find-semforpage (+ 14 146) "6.9 Quantificação e movimento")
;; (find-semforpage (+ 14 149) "6.9.1 Movimento e escopo")
;; (find-semforpage (+ 14 153) "6.9.2 Negação e alçamento de quantificadores")
;; (find-semforpage (+ 14 158) "6.10 Quantificação e mudança de tipos")
;; (find-semforpage (+ 14 160) "6.10.1 Mudança de tipos e escopo")
;; (find-semforpage (+ 14 163) "6.10.2 Mudança de tipos, negação e escopo")
;; (find-semforpage (+ 14 165) "Sugestões de leitura")
;; (find-semforpage (+ 14 166) "Exercícios")
;; (find-semforpage (+ 14 169) "7 De volta aos pronomes")
;; (find-semforpage (+ 14 169) "7.1 Pronomes livres e ligados")
;; (find-semforpage (+ 14 170) "7.2 Correferência vs. ligação")
;; (find-semforpage (+ 14 173) "7.3 Ligação sem índices nem atribuições")
;; (find-semforpage (+ 14 178) "7.3.1 Limitando composição e ligação funcional")
;; (find-semforpage (+ 14 180) "7.3.2 Pronomes livres novamente")
;; (find-semforpage (+ 14 181) "Sugestões de leitura")
;; (find-semforpage (+ 14 182) "Exercícios")
;; (find-semforpage (+ 14 183) "Referências Bibliográficas")
;; «fitting» (to ".fitting")
;; http://gigapedia.com/items/255507/intuitionistic-logic--model-theory-and-forcing--studies-in-logic-and-the-foundations-of-mathematics-
(code-xpdf "fittingforcing" "~/books/__logic/fitting__intuitionistic_logic_model_theory_and_forcing.pdf")
;; (find-fittingforcingpage 8 "Chapter 1")
;; (find-fittingforcingpage (+ -14 190) "Index")
;; «flower-masthoff-stapleton» (to ".flower-masthoff-stapleton")
;; (find-books "__logic/__logic.el" "flower-masthoff-stapleton")
(code-pdf-page "genrps" "~/books/__logic/flower_masthoff_stapleton__generating_readable_proofs_a_heuristic_approach_to_theorem_proving_with_spider_diagrams.pdf")
(code-pdf-text "genrps" "~/books/__logic/flower_masthoff_stapleton__generating_readable_proofs_a_heuristic_approach_to_theorem_proving_with_spider_diagrams.pdf" 1)
;; (find-genrpspage)
;; (find-genrpstext "")
;; (find-genrpspage (+ -165 180) "Jamnik")
;; (find-genrpstext (+ -165 180) "Jamnik")
;; «frade» (to ".frade")
;; (find-books "__logic/__logic.el" "frade")
;; Maria Joao Frade: "Calculus of Inductive Constructions"
;; http://www4.di.uminho.pt/~mjf/
;; http://www4.di.uminho.pt/~mjf/pub/SFV-CIC-2up.pdf
(code-pdf-page "frade" "$S/http/www4.di.uminho.pt/~mjf/pub/SFV-CIC-2up.pdf")
(code-pdf-text "frade" "$S/http/www4.di.uminho.pt/~mjf/pub/SFV-CIC-2up.pdf")
;; (find-fradepage)
;; (find-fradetext)
;; «fraenkel» (to ".fraenkel")
;; http://gigapedia.com/items/255513/abstract-set-theory--studies-in-logic-and-the-foundations-of-mathematics-
(code-xpdf "fraenkelast" "~/books/__logic/fraenkel__abstract_set_theory.pdf")
;; (find-fraenkelastpage 1 "Contents")
;; (find-fraenkelastpage (+ 1 1) "Index")
;; «fraser» (to ".fraser")
;; (find-books "__logic/__logic.el" "fraser")
(code-pdf-page "frasergbaf" "~/books/__logic/fraser__go_back_to_an-fang.pdf")
(code-pdf-text "frasergbaf" "~/books/__logic/fraser__go_back_to_an-fang.pdf" 1)
;; (find-frasergbafpage)
;; (find-frasergbafpage 24 "0.4 An-Fang: introduction to ludics")
;; (find-frasergbaftext 24 "0.4 An-Fang: introduction to ludics")
;; (find-frasergbafpage 1 "Contents")
;; (find-frasergbafpage (+ 1 189) "Index")
;; (find-frasergbaftext "")
;; «gabbay» (to ".gabbay")
;; http://gigapedia.com/items/120096/labelled-deductive-systems--volume-1--oxford-logic-guides-
(code-djvu "gabbaylds1" "~/books/__logic/gabbay__labelled_deductive_systems_vol_1.djvu")
(code-djvutotext "gabbaylds1" "~/books/__logic/gabbay__labelled_deductive_systems_vol_1.djvu")
;; (find-gabbaylds1page 11 "Contents")
;; (find-gabbaylds1page (+ 14 1) "1. What is a logical system?")
;; (find-gabbaylds1page (+ 14 10) "Surgical cut")
;; (find-gabbaylds1page (+ 14 141) "3. Introducing Algebraic Labelled Deductive Systems")
;; (find-gabbaylds1page (+ 14 159) "Diagram rule")
;; (find-gabbaylds1page (+ 14 160) "Quantifier elimination and introduction rules")
;; (find-gabbaylds1page (+ 14 161) "proof from a database")
;; (find-gabbaylds1page (+ 14 176) "3.3. Introduction rules: a discussion")
;; (find-gabbaylds1page (+ 14 198) "3.5. The metabox system")
;; (find-gabbaylds1page (+ 14 251) "defeasible")
;; (find-gabbaylds1page (+ 14 321) "Micro-PROLOG")
;; (find-gabbaylds1page (+ 14 323) "6.5. Metalevel features via connectives")
;; (find-gabbaylds1page (+ 14 375) "8. Extending the Curry-Howard Interpretation to LDS Systems")
;; (find-gabbaylds1page (+ 14 493) "Index")
;; (find-gabbaylds1text "")
;; (find-books "__logic/__logic.el" "gabbay")
(code-pdf "siihil" "~/books/__logic/gabbay__semantical_investigations_in_heytings_intuitionistic_logic.pdf")
(code-pdftotext "siihil" "~/books/__logic/gabbay__semantical_investigations_in_heytings_intuitionistic_logic.pdf" 10)
;; (find-siihilpage)
;; (find-siihilpage 7 "Contents")
;; (find-siihilpage (+ 10 1) "Introduction")
;; (find-siihilpage (+ 10 285) "Index")
;; (find-siihiltext "")
;; «gentzen» (to ".gentzen")
;; (find-books "__logic/__logic.el" "gentzen")
;; (find-LATEX "catsem-u.bib" "bib-Gentzen")
(code-pdf-page "gentzenpapers" "~/books/__logic/gentzen__the_collected_papers.pdf")
(code-pdf-text "gentzenpapers" "~/books/__logic/gentzen__the_collected_papers.pdf" 7)
;; (find-gentzenpaperspage 5 "Contents")
;; (find-gentzenpaperspage (+ 7 68) "Investigations into logical deduction")
;; (find-gentzenpaperspage (+ 7 74) "11. THE CALCULUS OF NATURAL DEDUCTION")
;; (find-gentzenpaperstext (+ 7 74) "11. THE CALCULUS OF NATURAL DEDUCTION")
;; (find-gentzenpaperspage (+ 7 77) "The inference figure schemata:")
;; (find-gentzenpaperstext (+ 7 77) "The inference figure schemata:")
;; (find-gentzenpaperspage (+ 7 78) "Informal sense of NJ-inference figures")
;; (find-gentzenpaperstext (+ 7 78) "Informal sense of NJ-inference figures")
;; (find-gentzenpaperspage (+ 7 79) "The three examples of" "5 1" "as NJ-derivations")
;; (find-gentzenpaperstext (+ 7 79) "The three examples of" "5 1" "as NJ-derivations")
;; (find-gentzenpaperspage (+ 7 324) "Index of subjects")
;; (find-gentzenpaperstext (+ 7 74) "")
;; «geuvers» (to ".geuvers")
;; (find-books "__logic/__logic.el" "geuvers")
(code-pdf "geuversndgraphs" "~/books/__logic/geuvers_loeb__natural_deduction_via_graphs.pdf")
(code-pdftotext "geuversndgraphs" "~/books/__logic/geuvers_loeb__natural_deduction_via_graphs.pdf" 1)
;; (find-geuversndgraphspage)
;; (find-geuversndgraphspage 1 "Contents")
;; (find-geuversndgraphspage (+ 1 189) "Index")
;; (find-geuversndgraphstext "")
;; «giardino» (to ".giardino")
;; (find-books "__logic/__logic.el" "giardino")
(code-pdf-page "giardinodrim" "~/books/__logic/giardino__diagrammatic_reasoning_in_mathematics.pdf")
(code-pdf-text "giardinodrim" "~/books/__logic/giardino__diagrammatic_reasoning_in_mathematics.pdf" -498)
;; (find-giardinodrimpage)
;; (find-giardinodrimtext "")
;; (find-giardinodrimpage (+ -498 517) "Jamnik")
;; (find-giardinodrimtext (+ -498 517) "Jamnik")
;; «girard» (to ".girard")
;; (find-books "__logic/__logic.el" "girard")
;; (find-LATEX "catsem-u.bib" "bib-GLT")
;; http://www.paultaylor.eu/stable/Proofs+Types.html
;; http://www.paultaylor.eu/stable/prot.pdf
(code-pdf-page "proofsandtypes" "~/books/__logic/girard__proofs_and_types.pdf")
(code-pdf-text "proofsandtypes" "~/books/__logic/girard__proofs_and_types.pdf" 8)
;; (find-proofsandtypespage)
;; (find-proofsandtypespage 4 "Contents")
;; (find-proofsandtypespage (+ 8 1) "1 Sense, Denotation and Semantics")
;; (find-proofsandtypespage (+ 8 1) "1.1 Sense and denotation in logic")
;; (find-proofsandtypespage (+ 8 3) "1.1.1 The algebraic tradition")
;; (find-proofsandtypespage (+ 8 3) "1.1.2 The syntactic tradition")
;; (find-proofsandtypespage (+ 8 4) "1.2 The two semantic traditions")
;; (find-proofsandtypespage (+ 8 4) "1.2.1 Tarski")
;; (find-proofsandtypespage (+ 8 5) "1.2.2 Heyting")
;; (find-proofsandtypespage (+ 8 8) "2 Natural Deduction")
;; (find-proofsandtypespage (+ 8 9) "2.1 The calculus")
;; (find-proofsandtypespage (+ 8 10) "2.1.1 The rules")
;; (find-proofsandtypespage (+ 8 10) "2.2 Computational significance")
;; (find-proofsandtypespage (+ 8 11) "2.2.1 Interpretation of the rules")
;; (find-proofsandtypespage (+ 8 13) "2.2.2 Identification of deductions")
;; (find-proofsandtypespage (+ 8 14) "3 The Curry-Howard Isomorphism")
;; (find-proofsandtypespage (+ 8 15) "3.1 Lambda Calculus")
;; (find-proofsandtypespage (+ 8 15) "3.1.1 Types")
;; (find-proofsandtypespage (+ 8 15) "3.1.2 Terms")
;; (find-proofsandtypespage (+ 8 16) "3.2 Denotational significance")
;; (find-proofsandtypespage (+ 8 17) "3.3 Operational significance")
;; (find-proofsandtypespage (+ 8 18) "3.4 Conversion")
;; (find-proofsandtypespage (+ 8 19) "3.5 Description of the isomorphism")
;; (find-proofsandtypespage (+ 8 20) "3.6 Relevance of the isomorphism")
;; (find-proofsandtypespage (+ 8 22) "4 The Normalisation Theorem")
;; (find-proofsandtypespage (+ 8 22) "4.1 The Church-Rosser property")
;; (find-proofsandtypespage (+ 8 24) "4.2 The weak normalisation theorem")
;; (find-proofsandtypespage (+ 8 24) "4.3 Proof of the weak normalisation theorem")
;; (find-proofsandtypespage (+ 8 25) "4.3.1 Degree and substitution")
;; (find-proofsandtypespage (+ 8 25) "4.3.2 Degree and conversion")
;; (find-proofsandtypespage (+ 8 26) "4.3.3 Conversion of maximal degree")
;; (find-proofsandtypespage (+ 8 26) "4.3.4 Proof of the theorem")
;; (find-proofsandtypespage (+ 8 26) "4.4 The strong normalisation theorem")
;; (find-proofsandtypespage (+ 8 28) "5 Sequent Calculus")
;; (find-proofsandtypespage (+ 8 29) "5.1 The calculus")
;; (find-proofsandtypespage (+ 8 29) "5.1.1 Sequents")
;; (find-proofsandtypespage (+ 8 29) "5.1.2 Structural rules")
;; (find-proofsandtypespage (+ 8 30) "5.1.3 The intuitionistic case")
;; (find-proofsandtypespage (+ 8 30) "5.1.4 The "identity" group")
;; (find-proofsandtypespage (+ 8 31) "5.1.5 Logical rules")
;; (find-proofsandtypespage (+ 8 32) "5.2 Some properties of the system without cut")
;; (find-proofsandtypespage (+ 8 33) "5.2.1 The last rule")
;; (find-proofsandtypespage (+ 8 33) "5.2.2 Subformula property")
;; (find-proofsandtypespage (+ 8 34) "5.2.3 Asymmetrical interpretation")
;; (find-proofsandtypespage (+ 8 35) "5.3 Sequent Calculus and Natural Deduction")
;; (find-proofsandtypespage (+ 8 38) "5.4 Properties of the translation")
;; (find-proofsandtypespage (+ 8 41) "6 Strong Normalisation Theorem")
;; (find-proofsandtypespage (+ 8 41) "6.1 Reducibility")
;; (find-proofsandtypespage (+ 8 42) "6.2 Properties of reducibility")
;; (find-proofsandtypespage (+ 8 42) "6.2.1 Atomic types")
;; (find-proofsandtypespage (+ 8 43) "6.2.2 Product type")
;; (find-proofsandtypespage (+ 8 43) "6.2.3 Arrow type")
;; (find-proofsandtypespage (+ 8 44) "6.3 Reducibility theorem")
;; (find-proofsandtypespage (+ 8 44) "6.3.1 Pairing")
;; (find-proofsandtypespage (+ 8 44) "6.3.2 Abstraction")
;; (find-proofsandtypespage (+ 8 45) "6.3.3 The theorem")
;; (find-proofsandtypespage (+ 8 46) "7 Godel's system T")
;; (find-proofsandtypespage (+ 8 47) "7.1 The calculus")
;; (find-proofsandtypespage (+ 8 47) "7.1.1 Types")
;; (find-proofsandtypespage (+ 8 47) "7.1.2 Terms")
;; (find-proofsandtypespage (+ 8 47) "7.1.3 Intended meaning")
;; (find-proofsandtypespage (+ 8 47) "7.1.4 Conversions")
;; (find-proofsandtypespage (+ 8 48) "7.2 Normalisation theorem")
;; (find-proofsandtypespage (+ 8 49) "7.3 Expressive power: examples")
;; (find-proofsandtypespage (+ 8 49) "7.3.1 Booleans")
;; (find-proofsandtypespage (+ 8 49) "7.3.2 Integers")
;; (find-proofsandtypespage (+ 8 51) "7.4 Expressive power: results")
;; (find-proofsandtypespage (+ 8 51) "7.4.1 Canonical forms")
;; (find-proofsandtypespage (+ 8 51) "7.4.2 Representable functions")
;; (find-proofsandtypespage (+ 8 53) "8 Coherence Spaces")
;; (find-proofsandtypespage (+ 8 53) "8.1 General ideas")
;; (find-proofsandtypespage (+ 8 55) "8.2 Coherence Spaces")
;; (find-proofsandtypespage (+ 8 55) "8.2.1 The web of a coherence space")
;; (find-proofsandtypespage (+ 8 56) "8.2.2 Interpretation")
;; (find-proofsandtypespage (+ 8 57) "8.3 Stable functions")
;; (find-proofsandtypespage (+ 8 59) "8.3.1 Stable functions on a flat space")
;; (find-proofsandtypespage (+ 8 59) "8.3.2 Parallel Or")
;; (find-proofsandtypespage (+ 8 60) "8.4 Direct product of two coherence spaces")
;; (find-proofsandtypespage (+ 8 61) "8.5 The Function-Space")
;; (find-proofsandtypespage (+ 8 61) "8.5.1 The trace of a stable function")
;; (find-proofsandtypespage (+ 8 63) "8.5.2 Representation of the function space")
;; (find-proofsandtypespage (+ 8 64) "8.5.3 The Berry order")
;; (find-proofsandtypespage (+ 8 65) "8.5.4 Partial functions")
;; (find-proofsandtypespage (+ 8 66) "9 Denotational Semantics of T")
;; (find-proofsandtypespage (+ 8 66) "9.1 Simple typed calculus")
;; (find-proofsandtypespage (+ 8 66) "9.1.1 Types")
;; (find-proofsandtypespage (+ 8 67) "9.1.2 Terms")
;; (find-proofsandtypespage (+ 8 68) "9.2 Properties of the interpretation")
;; (find-proofsandtypespage (+ 8 69) "9.3 Godel's system")
;; (find-proofsandtypespage (+ 8 69) "9.3.1 Booleans")
;; (find-proofsandtypespage (+ 8 69) "9.3.2 Integers")
;; (find-proofsandtypespage (+ 8 71) "9.3.3 Infinity and fixed point")
;; (find-proofsandtypespage (+ 8 72) "10 Sums in Natural Deduction")
;; (find-proofsandtypespage (+ 8 72) "10.1 Defects of the system")
;; (find-proofsandtypespage (+ 8 73) "10.2 Standard conversions")
;; (find-proofsandtypespage (+ 8 74) "10.3 The need for extra conversions")
;; (find-proofsandtypespage (+ 8 75) "10.3.1 Subformula Property")
;; (find-proofsandtypespage (+ 8 76) "10.3.2 Extension to the full fragment")
;; (find-proofsandtypespage (+ 8 76) "10.4 Commuting conversions")
;; (find-proofsandtypespage (+ 8 78) "10.5 Properties of conversion")
;; (find-proofsandtypespage (+ 8 79) "10.6 The associated functional calculus")
;; (find-proofsandtypespage (+ 8 79) "10.6.1 Empty type (corresponding to )")
;; (find-proofsandtypespage (+ 8 80) "10.6.2 Sum type (corresponding to )")
;; (find-proofsandtypespage (+ 8 80) "10.6.3 Additional conversions")
;; (find-proofsandtypespage (+ 8 81) "11 System F")
;; (find-proofsandtypespage (+ 8 81) "11.1 The calculus")
;; (find-proofsandtypespage (+ 8 82) "11.2 Comments")
;; (find-proofsandtypespage (+ 8 83) "11.3 Representation of simple types")
;; (find-proofsandtypespage (+ 8 83) "11.3.1 Booleans")
;; (find-proofsandtypespage (+ 8 83) "11.3.2 Product of types")
;; (find-proofsandtypespage (+ 8 84) "11.3.3 Empty type")
;; (find-proofsandtypespage (+ 8 84) "11.3.4 Sum type")
;; (find-proofsandtypespage (+ 8 85) "11.3.5 Existential type")
;; (find-proofsandtypespage (+ 8 85) "11.4 Representation of a free structure")
;; (find-proofsandtypespage (+ 8 86) "11.4.1 Free structure")
;; (find-proofsandtypespage (+ 8 87) "11.4.2 Representation of the constructors")
;; (find-proofsandtypespage (+ 8 87) "11.4.3 Induction")
;; (find-proofsandtypespage (+ 8 88) "11.5 Representation of inductive types")
;; (find-proofsandtypespage (+ 8 88) "11.5.1 Integers")
;; (find-proofsandtypespage (+ 8 90) "11.5.2 Lists")
;; (find-proofsandtypespage (+ 8 92) "11.5.3 Binary trees")
;; (find-proofsandtypespage (+ 8 92) "11.5.4 Trees of branching type U")
;; (find-proofsandtypespage (+ 8 93) "11.6 The Curry-Howard Isomorphism")
;; (find-proofsandtypespage (+ 8 94) "12 Coherence Semantics of the Sum")
;; (find-proofsandtypespage (+ 8 95) "12.1 Direct sum")
;; (find-proofsandtypespage (+ 8 95) "12.2 Lifted sum")
;; (find-proofsandtypespage (+ 8 97) "12.2.1 dI-domains")
;; (find-proofsandtypespage (+ 8 98) "12.3 Linearity")
;; (find-proofsandtypespage (+ 8 98) "12.3.1 Characterisation in terms of preservation")
;; (find-proofsandtypespage (+ 8 99) "12.3.2 Linear implication")
;; (find-proofsandtypespage (+ 8 100) "12.4 Linearisation")
;; (find-proofsandtypespage (+ 8 102) "12.5 Linearised sum")
;; (find-proofsandtypespage (+ 8 103) "12.6 Tensor product and units")
;; (find-proofsandtypespage (+ 8 104) "13 Cut Elimination (Hauptsatz)")
;; (find-proofsandtypespage (+ 8 104) "13.1 The key cases")
;; (find-proofsandtypespage (+ 8 108) "13.2 The principal lemma")
;; (find-proofsandtypespage (+ 8 110) "13.3 The Hauptsatz")
;; (find-proofsandtypespage (+ 8 111) "13.4 Resolution")
;; (find-proofsandtypespage (+ 8 113) "14 Strong Normalisation for F")
;; (find-proofsandtypespage (+ 8 114) "14.1 Idea of the proof")
;; (find-proofsandtypespage (+ 8 114) "14.1.1 Reducibility candidates")
;; (find-proofsandtypespage (+ 8 114) "14.1.2 Remarks")
;; (find-proofsandtypespage (+ 8 115) "14.1.3 Definitions")
;; (find-proofsandtypespage (+ 8 116) "14.2 Reducibility with parameters")
;; (find-proofsandtypespage (+ 8 117) "14.2.1 Substitution")
;; (find-proofsandtypespage (+ 8 117) "14.2.2 Universal abstraction")
;; (find-proofsandtypespage (+ 8 117) "14.2.3 Universal application")
;; (find-proofsandtypespage (+ 8 118) "14.3 Reducibility theorem")
;; (find-proofsandtypespage (+ 8 119) "15 Representation Theorem")
;; (find-proofsandtypespage (+ 8 120) "15.1 Representable functions")
;; (find-proofsandtypespage (+ 8 120) "15.1.1 Numerals")
;; (find-proofsandtypespage (+ 8 121) "15.1.2 Total recursive functions")
;; (find-proofsandtypespage (+ 8 122) "15.1.3 Provably total functions")
;; (find-proofsandtypespage (+ 8 123) "15.2 Proofs into programs")
;; (find-proofsandtypespage (+ 8 124) "15.2.1 Formulation of HA2")
;; (find-proofsandtypespage (+ 8 125) "15.2.2 Translation of HA2 into F")
;; (find-proofsandtypespage (+ 8 126) "15.2.3 Representation of provably total functions")
;; (find-proofsandtypespage (+ 8 128) "15.2.4 Proof without undefined objects")
;; (find-proofsandtypespage (+ 8 131) "A Semantics of System F")
;; (find-proofsandtypespage (+ 8 131) "A.1 Terms of universal type")
;; (find-proofsandtypespage (+ 8 131) "A.1.1 Finite approximation")
;; (find-proofsandtypespage (+ 8 132) "A.1.2 Saturated domains")
;; (find-proofsandtypespage (+ 8 133) "A.1.3 Uniformity")
;; (find-proofsandtypespage (+ 8 134) "A.2 Rigid Embeddings")
;; (find-proofsandtypespage (+ 8 135) "A.2.1 Functoriality of arrow")
;; (find-proofsandtypespage (+ 8 136) "A.3 Interpretation of Types")
;; (find-proofsandtypespage (+ 8 137) "A.3.1 Tokens for universal types")
;; (find-proofsandtypespage (+ 8 138) "A.3.2 Linear notation for tokens")
;; (find-proofsandtypespage (+ 8 139) "A.3.3 The three simplest types")
;; (find-proofsandtypespage (+ 8 140) "A.4 Interpretation of terms")
;; (find-proofsandtypespage (+ 8 140) "A.4.1 Variable coherence spaces")
;; (find-proofsandtypespage (+ 8 141) "A.4.2 Coherence of tokens")
;; (find-proofsandtypespage (+ 8 143) "A.4.3 Interpretation of F")
;; (find-proofsandtypespage (+ 8 144) "A.5 Examples")
;; (find-proofsandtypespage (+ 8 144) "A.5.1 Of course")
;; (find-proofsandtypespage (+ 8 146) "A.5.2 Natural Numbers")
;; (find-proofsandtypespage (+ 8 147) "A.5.3 Linear numerals")
;; (find-proofsandtypespage (+ 8 148) "A.6 Total domains")
;; (find-proofsandtypespage (+ 8 149) "B What is Linear Logic?")
;; (find-proofsandtypespage (+ 8 149) "B.1 Classical logic is not constructive")
;; (find-proofsandtypespage (+ 8 151) "B.2 Linear Sequent Calculus")
;; (find-proofsandtypespage (+ 8 154) "B.3 Proof nets")
;; (find-proofsandtypespage (+ 8 157) "B.4 Cut elimination")
;; (find-proofsandtypespage (+ 8 160) "B.5 Proof nets and natural deduction")
;; (find-proofsandtypespage (+ 8 161) "Bibliography")
;; (find-proofsandtypespage (+ 8 165) "Index and index of notation")
;; (find-proofsandtypestext "")
;;
;; file:///home/edrx/snarf/http/www.paultaylor.eu/stable/prot.pdf
;; «girard-blind-spot» (to ".girard-blind-spot")
;; (find-books "__logic/__logic.el" "girard-blind-spot")
;; https://www.ems-ph.org/books/book.php?proj_nr=136&srch=browse_authors%7CGirard%2C+Jean-Yves
;; https://www.maa.org/press/maa-reviews/the-blind-spot-lectures-on-logic
;; https://news.ycombinator.com/item?id=14249733
;; https://www.ems-ph.org/books/toc/136/Review%20in%20MR%202896656.pdf
(code-pdf-page "blindspot" "~/books/__logic/girard__the_blind_spot.pdf")
(code-pdf-text "blindspot" "~/books/__logic/girard__the_blind_spot.pdf" 1)
;; (find-blindspotpage)
;; (find-blindspotpage 6 "Contents")
;; (find-blindspotpage (+ 1 189) "Index")
;; (find-blindspottext "")
;; «girard-tcs87» (to ".girard-tcs87")
;; (find-books "__logic/__logic.el" "girard-tcs87")
;; https://www.sciencedirect.com/journal/theoretical-computer-science/vol/50/issue/1
(code-pdf-page "girardtcs87" "~/books/__logic/girard__linear_logic_tcs_1987.pdf")
(code-pdf-text "girardtcs87" "~/books/__logic/girard__linear_logic_tcs_1987.pdf" 1)
;; (find-girardtcs87page)
;; (find-girardtcs87page 1 "Contents")
;; (find-girardtcs87text 1 "Contents")
;; (find-girardtcs87page 2 "I. Introduction and abstract")
;; (find-girardtcs87page 4 "II. Linear logic explained to a proof-theorist.")
;; (find-girardtcs87page 4 "11.1. The maintenance of space in sequent calculus")
;; (find-girardtcs87page 4 "11.2. Linear logic as a sequent calculus")
;; (find-girardtcs87page 5 "11.3. Strength of linear logic")
;; (find-girardtcs87page 6 "11.4. Subtlety of linear logic")
;; (find-girardtcs87page 6 "11.5. me semantics of linear logic: phased")
;; (find-girardtcs87page 7 "III. Linear logic explained to a (theoretical) computer scientist")
;; (find-girardtcs87page 8 "111.1. The semantics of linear logic: coherent spaces")
;; (find-girardtcs87page 8 "111.2. Proof-nets: a Glassical natural deduction")
;; (find-girardtcs87page 11 "III.3. Normalization for proof-nets")
;; (find-girardtcs87page 12 "111.4. Relevance for computer science.")
;; (find-girardtcs87page 12 "111.4.1. Questions and answers")
;; (find-girardtcs87page 12 "111.4.2. Towards parallelism")
;; (find-girardtcs87page 13 "111.4.3. Communication and trips")
;; (find-girardtcs87page 14 "111.4.4. Work in progress")
;; (find-girardtcs87page 14 "IV. Pons asinorum: from usual implication to linear implication")
;; (find-girardtcs87page 15 "IV.l. Interpretation of functional languages.")
;; (find-girardtcs87page 15 "IV.2. Thedisturbance")
;; (find-girardtcs87page 16 "IV.3. The decomposition")
;; (find-girardtcs87page 17 "IV.4. Further questions")
;; (find-girardtcs87page 17 "1. The phase semantics")
;; (find-girardtcs87page 28 "2. Proof-nets")
;; (find-girardtcs87page 30 "2.1. The concept of trip")
;; (find-girardtcs87page 40 "2.2. Thecutrule")
;; (find-girardtcs87page 41 "2.3. Cut elimination")
;; (find-girardtcs87page 44 "2.4. Thesystem PNl")
;; (find-girardtcs87page 46 "2.5. The system PN2")
;; (find-girardtcs87page 47 "2.6. Discussion.")
;; (find-girardtcs87page 48 "3. Conetent semantics")
;; (find-girardtcs87page 60 "4. Normalization in PN2")
;; (find-girardtcs87page 61 "4.1. Axiomcontraction")
;; (find-girardtcs87page 62 "4.2. Symmetric contractions")
;; (find-girardtcs87page 65 "4.3. Commutative contractions")
;; (find-girardtcs87page 78 "5. Some useful transiations")
;; (find-girardtcs87page 78 "5.1. The translation of intuitionisiic logic")
;; (find-girardtcs87page 82 "5.2. The translation of the system F")
;; (find-girardtcs87page 82 "5.2.1. Types")
;; (find-girardtcs87page 82 "5.2.2. Translation of terms.")
;; (find-girardtcs87page 84 "5.2.3. Semantic soundness of the translation")
;; (find-girardtcs87page 85 "5.2.4. Syntactic soundness of the translation")
;; (find-girardtcs87page 85 "5.3. The translation of current data in PN2")
;; (find-girardtcs87page 86 "5.3.1. Booleans")
;; (find-girardtcs87page 86 "5.3.2. Integers")
;; (find-girardtcs87page 90 "5.33. Lists, trees")
;; (find-girardtcs87page 90 "5.4. Interpretation of classical logic")
;; (find-girardtcs87page 91 "5.5. Translation of cut-free classical logic.")
;; (find-girardtcs87page 92 "5.6. The Approximation Theorem")
;; (find-girardtcs87page 93 "6. Work in progress: slices")
;; (find-girardtcs87page 97 "V. Two years of linear logic: selection from the garbage collector")
;; (find-girardtcs87page 97 "V.l. The first glimpses")
;; (find-girardtcs87page 98 "V.2. The quantitative attempt")
;; (find-girardtcs87page 98 "V.3. The intuitionistic attempt")
;; (find-girardtcs87page 99 "V.4. Recent developments")
;; (find-girardtcs87page 100 "V.5. The exponentials")
;; (find-girardtcs87page 101 "Acknowledgment")
;; (find-girardtcs87page 102 "References")
;; (find-girardtcs87text "")
;; «girard-tet» (to ".girard-tet")
;; Jean-Yves Girard: titres et travaux
;; https://girard.perso.math.cnrs.fr/titres.pdf
(code-pdf-page "girardtet" "$S/https/girard.perso.math.cnrs.fr/titres.pdf")
(code-pdf-text "girardtet" "$S/https/girard.perso.math.cnrs.fr/titres.pdf")
;; (find-girardtetpage)
;; (find-girardtettext)
;; (find-girardtetpage 31 "Bibliographie sélective")
;; (find-girardtettext 31 "Bibliographie sélective")
;; https://www.sciencedirect.com/journal/theoretical-computer-science/vol/50/issue/1
;; https://girard.perso.math.cnrs.fr/Logique.html
;; https://girard.perso.math.cnrs.fr/Accueil.html
;; https://girard.perso.math.cnrs.fr/Ringard.html
;; https://girard.perso.math.cnrs.fr/Archives.html
;; https://girard.perso.math.cnrs.fr/titres.pdf
;; On Girard's latest works:
;; https://nguyentito.eu/
;; https://nguyentito.eu/ Nguyen Le Than Dung
;; https://nguyentito.eu/2018-11-scalp.pdf
;; https://engboris.github.io/
;; https://engboris.github.io/documents/report_m2.pdf
;; https://engboris.github.io/library/
;; https://www.engboris.fr/ts/ girard - transcendental syntax
;; https://www.seiller.org/documents/articles/Stellar.pdf
;; «godel» (to ".godel")
;; (find-books "__logic/__logic.el" "godel")
;; (find-LATEX "catsem.bib" "bib-Goedel")
(code-pdf "godel1" "~/books/__logic/godel___collected_works_1.pdf")
(code-pdftotext "godel1" "~/books/__logic/godel___collected_works_1.pdf" 27)
(code-pdf "godel2" "~/books/__logic/godel___collected_works_2.pdf")
(code-pdftotext "godel2" "~/books/__logic/godel___collected_works_2.pdf" 19)
;; (find-godel1page)
;; (find-godel1page 18 "Contents")
;; (find-godel1page (+ 27 16) "Works in the first two volumes")
;; (find-godel1page (+ 27 223) "On the intuitionistic propositional calculus")
;; (find-godel1page (+ 27 296) "Introductory note to 1933f")
;; (find-godel1page (+ 27 301) "An interpretation of the intuitionistic propositional calculus (1933f)")
;; (find-godel1page (+ 27 461) "Index")
;; (find-godel1text "")
;; (find-godel2page)
;; (find-godel2page 14 "Contents")
;; (find-godel2page (+ 19 1) "Index")
;; (find-godel2page (+ 19 393) "Index")
;; (find-godel2text "")
;; «goranko» (to ".goranko")
;; (find-books "__logic/__logic.el" "goranko")
;; http://www2.imm.dtu.dk/courses/02286/Slides/FirstOrderLogicSyntaxFreeBoundVarsQuantScopeCaptureSubstRenamingTrans.pdf
(code-pdf-page "gorankosubs" "$S/http/www2.imm.dtu.dk/courses/02286/Slides/FirstOrderLogicSyntaxFreeBoundVarsQuantScopeCaptureSubstRenamingTrans.pdf")
(code-pdf-text "gorankosubs" "$S/http/www2.imm.dtu.dk/courses/02286/Slides/FirstOrderLogicSyntaxFreeBoundVarsQuantScopeCaptureSubstRenamingTrans.pdf")
;; (find-gorankosubspage)
;; (find-gorankosubstext)
;; «grande» (to ".grande")
;; (find-books "__logic/__logic.el" "grande")
(code-pdf-page "grandesymm" "~/books/__logic/grande__on_symbolization_in_mathematics.pdf")
(code-pdf-text "grandesymm" "~/books/__logic/grande__on_symbolization_in_mathematics.pdf" 1)
;; (find-grandesymmpage)
;; (find-grandesymmpage 1 "Contents")
;; (find-grandesymmpage (+ 1 189) "Index")
;; (find-grandesymmtext "")
;; «grande-silva» (to ".grande-silva")
;; (find-books "__logic/__logic.el" "grande-silva")
;; https://www.editorafi.org/251simbolo
(code-pdf-page "simbolo" "~/books/__logic/grande_silva__o_simbolo_e_a_realidade.pdf")
(code-pdf-text "simbolo" "~/books/__logic/grande_silva__o_simbolo_e_a_realidade.pdf" 1)
;; (find-simbolopage)
;; (find-simbolopage 9 "Contents")
;; (find-simbolopage (+ 1 189) "Index")
;; (find-simbolotext "")
;; (find-simbolopage 11 "Prefácio")
;; (find-simbolopage 13 "1 Introdução")
;; (find-simbolopage 13 "1.1 O fascínio pelos números")
;; (find-simbolopage 16 "1.2 Objetivos, linguagem e reflexão filosófica")
;; (find-simbolopage 22 "2 Tipos de notação")
;; (find-simbolopage 29 "3 Funções básicas da notação matemática")
;; (find-simbolopage 29 "3.1 Preâmbulo filosófico")
;; (find-simbolopage 31 "3.2 Aspectos fundamentais da notação")
;; (find-simbolopage 33 "de modo implícito")
;; (find-simbolotext 33 "de modo implícito")
;; (find-simbolopage 67 "4 O símbolo e a realidade - análise filosófica")
;; (find-simbolopage 67 "4.1 Realidade fenomênica")
;; (find-simbolopage 73 "4.2 O Estruturalismo e o realismo de Born")
;; (find-simbolopage 77 "5 Conclusões")
;; (find-simbolopage 79 "6 Apêndice: raciocínio diagramático em mecânica quântica")
;; (find-simbolopage 79 "6.1 Introdução histórica")
;; (find-simbolopage 82 "6.2 O que é um diagrama de Feynman?")
;; (find-simbolopage 82 "6.2.1 Raciocínios diagramáticos")
;; (find-simbolopage 85 "6.2.2 Diagramas de Feynman")
;; (find-simbolopage 88 "6.3 O que exatamente um diagrama de Feynman representa?")
;; (find-simbolopage 88 "6.3.1 A matemática e a realidade empírica")
;; (find-simbolopage 90 "6.3.2 Diagramática geral - uma abordagem informal")
;; (find-simbolopage 92 "6.3.3 Exemplo prático")
;; (find-simbolopage 94 "6.4 Observações")
;; (find-simbolopage 95 "6.5 Conclusões")
;; (find-simbolopage 96 "7 Apêndice: o pensamento simbólico em Granger")
;; (find-simbolopage 96 "7.1 Introdução")
;; (find-simbolopage 101 "7.2 Forma e conteúdo na física")
;; (find-simbolopage 105 "7.3 Paradigma e tema")
;; (find-simbolopage 108 "7.4.1 Grau zero da relação forma-conteúdo e o cálculo proposicional")
;; (find-simbolopage 110 "7.4.2 Objeto matemático")
;; (find-simbolopage 114 "7.5 Conclusões")
;; (find-simbolopage 116 "8 Apêndice: Sobre a história da matemática e o uso...")
;; (find-simbolopage 132 "Conclusões")
;; (find-simbolopage 133 "Referências")
;; (find-simbolotext 133 "Referências")
;; «krantz-parks» (to ".krantz-parks")
;; (find-books "__logic/__logic.el" "krantz-parks")
(code-pdf-page "implift" "~/books/__logic/krantz_parks__the_implicit_function_theorem_history_theory_and_applications.pdf")
(code-pdf-text "implift" "~/books/__logic/krantz_parks__the_implicit_function_theorem_history_theory_and_applications.pdf" 10)
;; (find-impliftpage)
;; (find-impliftpage 6 "Contents")
;; (find-impliftpage (+ 10 1) "Index")
;; (find-implifttext "")
;; «gries-schneider» (to ".gries-schneider")
(code-xpdf "griesschneider" "~/books/__logic/gries_schneider__a_logical_approach_to_discrete_math.pdf")
(code-pdftotext "griesschneider" "~/books/__logic/gries_schneider__a_logical_approach_to_discrete_math.pdf")
;; (find-griesschneiderpage 1 "Contents")
;; (find-griesschneiderpage (+ 1 1) "Index")
;; (find-griesschneidertext "")
;; «gun» (to ".gun")
;; (find-books "__logic/__logic.el" "gun")
;; https://fu-berlin.academia.edu/OzgeEkin
;; https://hesperusisbosphorus.wordpress.com/2016/09/18/two-talks-at-bogazici-by-ozge-ekin-gun-on-the-philosophy-of-maths-and-kant-2223092016/
;; https://hesperusisbosphorus.files.wordpress.com/2016/09/ozge-kant-talk.pdf
;;
;; Ozge Ekin Gun: "New Approaches to Visual Reasoning in Mathematics
;; and Kantian Characterization of Mathematics" (PhD thesis, 2015)
;; https://refubium.fu-berlin.de/bitstream/handle/fub188/4990/PhD.pdf
(code-pdf-page "gunphd" "$S/https/refubium.fu-berlin.de/bitstream/handle/fub188/4990/PhD.pdf")
(code-pdf-text "gunphd" "$S/https/refubium.fu-berlin.de/bitstream/handle/fub188/4990/PhD.pdf")
;; (find-gunphdpage)
;; (find-gunphdtext)
;; (find-gunphdpage 3 "TABLE OF CONTENTS")
;; (find-gunphdtext 3 "TABLE OF CONTENTS")
;; (find-gunphdpage (+ 5 6) "I. Introduction")
;; (find-gunphdpage (+ 5 6) "1.1 Intuition, Diagram, Visual Reasoning in Mathematics")
;; (find-gunphdpage (+ 5 11) "1.2 The History and the Critique of Logicism")
;; (find-gunphdpage (+ 5 16) "1.3 Why is the Change in Perception of How One Practices Mathematics Necessary?")
;; (find-gunphdpage (+ 5 24) "1.4 Contemporary State of Visualization in Mathematics")
;; (find-gunphdpage (+ 5 30) "II. The Medium for Visual Reasoning:")
;; (find-gunphdpage (+ 5 32) "2.1 What is space?")
;; (find-gunphdpage (+ 5 38) "2.2 Kant's Notion of Space")
;; (find-gunphdpage (+ 5 40) "2.2.1 Kant's Historical Background")
;; (find-gunphdpage (+ 5 41) "2.2.2 Space as Pure Intuition: The Metaphysical Exposition")
;; (find-gunphdpage (+ 5 44) "2.2.3 Space as Form of Sensibility: The Transcendental Exposition")
;; (find-gunphdpage (+ 5 46) "2.2.4 Representations (Vorstellungen)")
;; (find-gunphdpage (+ 5 48) "2.2.5 Method for Representing: Schema")
;; (find-gunphdpage (+ 5 59) "2.2.6 The General Representation: Concept")
;; (find-gunphdpage (+ 5 60) "2.2.7 The Singular Representation: Intuition")
;; (find-gunphdpage (+ 5 65) "2.3 Kant's Characterization of Space and Visual Reasoning in Mathematics")
;; (find-gunphdpage (+ 5 70) "III. Methods for Visual Reasoning: Synthetic a priori, Construction and Abstraction")
;; (find-gunphdpage (+ 5 71) "3.1 The Definitions of Visualization and Methods Associated with these Definitions")
;; (find-gunphdpage (+ 5 77) "3.2 "Construction" and "Synthetic a priori " method")
;; (find-gunphdpage (+ 5 82) "3.2.1 The Method of Visual Reasoning in Mathematics")
;; (find-gunphdpage (+ 5 85) "3.2.2 Analytic and Synthetic")
;; (find-gunphdpage (+ 5 87) "3.2.3 Analytic and Synthetic in the Kantian Transcendental Philosophy")
;; (find-gunphdpage (+ 5 93) "3.2.4 Analytic and Synthetic as Judgments")
;; (find-gunphdpage (+ 5 98) "IV. Interpretations on Kant's notion of Space and Synthetic a priori Method")
;; (find-gunphdpage (+ 5 101) "4.1 Spaces's Original Representation is not a Concept")
;; (find-gunphdpage (+ 5 107) "4.2 Space's Original Representation is Pure Intuition")
;; (find-gunphdpage (+ 5 113) "4.3 Where does Synthetic and a priori Character of Mathematics Appear in Kant's Doctrine? Different Interpretations.")
;; (find-gunphdpage (+ 5 120) "4.3.1 Hintikka's Reconstruction of Kant's Mathematical Intuition")
;; (find-gunphdpage (+ 5 126) "4.4 Kant's Characterization of Mathematics and Modern Logic")
;; (find-gunphdpage (+ 5 129) "V. Visual Reasoning")
;; (find-gunphdpage (+ 5 131) "5.1 Diagrams as Formal Representation Systems")
;; (find-gunphdpage (+ 5 132) "5.1.1 Valid Reasoning with Diagrams")
;; (find-gunphdpage (+ 5 135) "5.1.2 Venn Diagrams as an Information Manipulating Formal Representation System")
;; (find-gunphdpage (+ 5 146) "5.2 Diagrams as Valid Reasoning Tools")
;; (find-gunphdpage (+ 5 146) "5.2.1 Diagrams in Proofs")
;; (find-gunphdpage (+ 5 164) "5.3 Visual Reasoning with Diagrams")
;; (find-gunphdpage (+ 5 166) "5.3.1 Perception and Recognition")
;; (find-gunphdpage (+ 5 173) "5.3.2 Diagrams and Mathematical Knowledge")
;; (find-gunphdpage (+ 5 182) "5.4 Valid Use of Diagrams in Mathematics")
;; (find-gunphdpage (+ 5 189) "VI. Conclusion")
;;
;; Ozge Ekin Gun: "Necessity of Visual Representations in Mathematics" (2016)
(code-pdf-page "gunnovrim" "~/books/__logic/gun__necessity_of_visual_representations_in_mathematics.pdf")
(code-pdf-text "gunnovrim" "~/books/__logic/gun__necessity_of_visual_representations_in_mathematics.pdf" 1)
;; (find-gunnovrimpage)
;; (find-gunnovrimpage 1 "Contents")
;; (find-gunnovrimpage (+ 1 189) "Index")
;; (find-gunnovrimtext "")
;; Gun: "Computer Imagery and the Rigor It Provides for the Mathematical Visual Reasoning" (2017)
(code-pdf-page "guncomputerim" "~/books/__logic/gun__computer_imagery_and_the_rigor_it_provides_for_the_mathematical_visual_reasoning.pdf")
(code-pdf-text "guncomputerim" "~/books/__logic/gun__computer_imagery_and_the_rigor_it_provides_for_the_mathematical_visual_reasoning.pdf" 1)
;; (find-guncomputerimpage)
;; (find-guncomputerimpage 1 "Contents")
;; (find-guncomputerimpage (+ 1 189) "Index")
;; (find-guncomputerimtext "")
;; Gun: "Kantian Intuition of Mathematical Objects and Diagrams" (2011)
(code-pdf-page "gundiagkant" "~/books/__logic/gun__diagrams_and_kantian_intuitions.pdf")
(code-pdf-text "gundiagkant" "~/books/__logic/gun__diagrams_and_kantian_intuitions.pdf" 1)
;; (find-gundiagkantpage)
;; (find-gundiagkantpage 1 "Contents")
;; (find-gundiagkantpage (+ 1 189) "Index")
;; (find-gundiagkanttext "")
;; «handbook-of-logic-in-CS» (to ".handbook-of-logic-in-CS")
;; (find-books "__logic/__logic.el" "handbook-of-logic-in-CS")
(code-pdf-page "handbookoflogicincs1" "~/books/__logic/handbook_of_logic_in_computer_science_vol_1_background_mathematical_structures.pdf")
(code-pdf-text "handbookoflogicincs1" "~/books/__logic/handbook_of_logic_in_computer_science_vol_1_background_mathematical_structures.pdf" 1)
;; (find-handbookoflogicincs1page)
;; (find-handbookoflogicincs1page 5 "Contents")
;; (find-handbookoflogicincs1page (+ 1 189) "Index")
;; (find-handbookoflogicincs1text "")
;; <handbook-of-logic-in-CS>
;; (find-books "__logic/__logic.el" "handbook-of-logic-in-CS")
(code-pdf-page "handbookoflogicincs2" "~/books/__logic/handbook_of_logic_in_computer_science_vol_2_background_computational_structures.pdf")
(code-pdf-text "handbookoflogicincs2" "~/books/__logic/handbook_of_logic_in_computer_science_vol_2_background_computational_structures.pdf" 1)
;; (find-handbookoflogicincs2page)
;; (find-handbookoflogicincs2page 8 "Contents")
;; (find-handbookoflogicincs2page (+ 1 189) "Index")
;; (find-handbookoflogicincs2text "")
;; <handbook-of-logic-in-CS>
;; (find-books "__logic/__logic.el" "handbook-of-logic-in-CS")
(code-pdf-page "handbookoflogicincs3" "~/books/__logic/handbook_of_logic_in_computer_science_vol_3_semantic_structures.pdf")
(code-pdf-text "handbookoflogicincs3" "~/books/__logic/handbook_of_logic_in_computer_science_vol_3_semantic_structures.pdf" 1)
;; (find-handbookoflogicincs3page)
;; (find-handbookoflogicincs3page 10 "Contents")
;; (find-handbookoflogicincs3page (+ 1 189) "Index")
;; (find-handbookoflogicincs3text "")
;; «henkin» (to ".henkin")
;; Leon Henkin: The logic of equality (1977)
;; https://www.jstor.org/stable/2321009
;; (find-books "__logic/__logic.el" "henkin")
(code-pdf "henkinleq" "~/books/__logic/henkin1977.pdf")
(code-pdftotext "henkinleq" "~/books/__logic/henkin1977.pdf" -595)
;; (find-henkinleqpage)
;; (find-henkinleqpage 1 "Contents")
;; (find-henkinleqpage (+ 1 189) "Index")
;; (find-henkinleqpage (+ -595 597))
;; (find-henkinleqtext (+ -595 597))
;; (find-henkinleqtext "")
;; «herbelin» (to ".herbelin")
;; http://pauillac.inria.fr/~herbelin/
;; https://www.cs.uoregon.edu/research/summerschool/summer11/lectures/oplss-herbelin1.pdf
(code-pdf-page "herbelin" "$S/https/www.cs.uoregon.edu/research/summerschool/summer11/lectures/oplss-herbelin1.pdf")
(code-pdf-text "herbelin" "$S/https/www.cs.uoregon.edu/research/summerschool/summer11/lectures/oplss-herbelin1.pdf")
;; (find-herbelinpage)
;; (find-herbelintext)
;; «hermogenesoliveira» (to ".hermogenesoliveira")
;; (find-books "__logic/__logic.el" "hermogenesoliveira")
(code-pdf-page "hermogenesolivphd" "~/books/__logic/hermogenes_oliveira__dissertation.pdf")
(code-pdf-text "hermogenesolivphd" "~/books/__logic/hermogenes_oliveira__dissertation.pdf" 10)
;; (find-hermogenesolivphdpage)
;; (find-hermogenesolivphdpage 9 "Contents")
;; (find-hermogenesolivphdtext 9 "Contents")
;; (find-hermogenesolivphdpage (+ 1 189) "Index")
;; (find-hermogenesolivphdtext "")
;; (find-hermogenesolivphdpage (+ 10 11) "1.2.3 The BHK interpretation")
;; (find-hermogenesolivphdtext (+ 10 11) "1.2.3 The BHK interpretation")
;; (find-hermogenesolivphdpage (+ 10 43) "5.1 BHK vs Gentzen")
;; (find-hermogenesolivphdtext (+ 10 43) "5.1 BHK vs Gentzen")
;; «hesseling» (to ".hesseling")
;; (find-books "__logic/__logic.el" "hesseling")
;; (find-LATEX "catsem-u.bib" "bib-Hesseling")
(code-pdf-page "gnomesinthefog" "~/books/__logic/hesseling__gnomes_in_the_fog_the_reception_of_brouwer_s_intuitionism_in_the_1920s.pdf")
(code-pdf-text "gnomesinthefog" "~/books/__logic/hesseling__gnomes_in_the_fog_the_reception_of_brouwer_s_intuitionism_in_the_1920s.pdf" 21)
;; (find-gnomesinthefogpage)
;; (find-gnomesinthefogpage 7 "Contents")
;; (find-gnomesinthefogpage (+ 21 1) "1 Kronecker, the semi-intuitionists, Poincare")
;; (find-gnomesinthefogpage (+ 21 1) "1.1 Introduction")
;; (find-gnomesinthefogpage (+ 21 2) "1.1.1 Mathematical prerequisites")
;; (find-gnomesinthefogpage (+ 21 4) "1. 2 Kronecker..........")
;; (find-gnomesinthefogpage (+ 21 5) "1.2.1 Kronecker's conflicts")
;; (find-gnomesinthefogpage (+ 21 6) "1.2.2 Kronecker's views")
;; (find-gnomesinthefogpage (+ 21 8) "1.3 The French semi-intuitionists")
;; (find-gnomesinthefogpage (+ 21 9) "1.3.1 The French semi-intuitionists' main conflict")
;; (find-gnomesinthefogpage (+ 21 12) "1.3.2 The French semi-intuitionists' views")
;; (find-gnomesinthefogpage (+ 21 18) "1.4 Poincare..........")
;; (find-gnomesinthefogpage (+ 21 18) "1.4.1 Poincare's conflicts")
;; (find-gnomesinthefogpage (+ 21 20) "1.4.2 Poincare's views")
;; (find-gnomesinthefogpage (+ 21 23) "1.5 Conclusion")
;; (find-gnomesinthefogpage (+ 21 25) "2 The genesis of Brouwer's intuitionism")
;; (find-gnomesinthefogpage (+ 21 25) "2.1 Introduction")
;; (find-gnomesinthefogpage (+ 21 26) "2.2 The early years")
;; (find-gnomesinthefogpage (+ 21 26) "2.2.1 Brouwer's youth")
;; (find-gnomesinthefogpage (+ 21 26) "2.2.2 Brouwer's profession of faith")
;; (find-gnomesinthefogpage (+ 21 28) "2.2.3 Mannoury......")
;; (find-gnomesinthefogpage (+ 21 30) "2.2.4 Brouwer's mysticism")
;; (find-gnomesinthefogpage (+ 21 34) "2.3 The first act of intuitionism")
;; (find-gnomesinthefogpage (+ 21 35) "2.3.1 Brouwer's dissertation")
;; (find-gnomesinthefogpage (+ 21 46) "2.3.2 The unreliability of the logical principles.")
;; (find-gnomesinthefogpage (+ 21 48) "2.4 Topology")
;; (find-gnomesinthefogpage (+ 21 52) "2.5 Intuitionism and formalism")
;; (find-gnomesinthefogpage (+ 21 58) "2.6 The second act of intuitionism")
;; (find-gnomesinthefogpage (+ 21 60) "2.6.1 Intuitionistic set theory")
;; (find-gnomesinthefogpage (+ 21 67) "2.6.2 Further development of intuitionistic mathematics")
;; (find-gnomesinthefogpage (+ 21 75) "2.7 The Brouwer lectures.")
;; (find-gnomesinthefogpage (+ 21 75) "2.7.1 Berlin")
;; (find-gnomesinthefogpage (+ 21 77) "2.7.2 Amsterdam")
;; (find-gnomesinthefogpage (+ 21 79) "2.7.3 Vienna.....")
;; (find-gnomesinthefogpage (+ 21 81) "2.8 The Mathematische Annalen and afterwards.")
;; (find-gnomesinthefogpage (+ 21 86) "2.9 Brouwer's personality")
;; (find-gnomesinthefogpage (+ 21 89) "2.10 Conclusion")
;; (find-gnomesinthefogpage (+ 21 91) "3 Overview of the foundational debate")
;; (find-gnomesinthefogpage (+ 21 91) "3.1 Introduction.......")
;; (find-gnomesinthefogpage (+ 21 93) "3.2 Quantitative inquiry")
;; (find-gnomesinthefogpage (+ 21 93) "3.2.1 The Fortschritte")
;; (find-gnomesinthefogpage (+ 21 95) "3.2.2 'All' public reactions to intuitionism")
;; (find-gnomesinthefogpage (+ 21 97) "3.3 Qualitative inquiry")
;; (find-gnomesinthefogpage (+ 21 97) "3.3.1 Themes")
;; (find-gnomesinthefogpage (+ 21 99) "3.3.2 Tone")
;; (find-gnomesinthefogpage (+ 21 104) "3.3.3 Currents and schools.")
;; (find-gnomesinthefogpage (+ 21 111) "3.3.4 People.........")
;; (find-gnomesinthefogpage (+ 21 113) "3.3.5 Languages and media")
;; (find-gnomesinthefogpage (+ 21 115) "3.4 Conclusion")
;; (find-gnomesinthefogpage (+ 21 117) "4 Reactions: existence and constructivity")
;; (find-gnomesinthefogpage (+ 21 117) "4.1 Introduction................")
;; (find-gnomesinthefogpage (+ 21 117) "4.1.1 Mathematical existence")
;; (find-gnomesinthefogpage (+ 21 120) "4.1.2 A short history of constructivism")
;; (find-gnomesinthefogpage (+ 21 124) "4.2 The beginning of the debate")
;; (find-gnomesinthefogpage (+ 21 125) "4.2.1 Weyl's Grundlagenkrise")
;; (find-gnomesinthefogpage (+ 21 133) "4.2.2 Hilbert's first reactions.")
;; (find-gnomesinthefogpage (+ 21 145) "4.2.3 Becker's phenomenology")
;; (find-gnomesinthefogpage (+ 21 149) "4.2.4 Fraenkel's early commentaries.")
;; (find-gnomesinthefogpage (+ 21 152) "4.2.5 Baldus' rector's address")
;; (find-gnomesinthefogpage (+ 21 154) "4.3 The debate widened")
;; (find-gnomesinthefogpage (+ 21 158) "4.3.1 Existence in a central position")
;; (find-gnomesinthefogpage (+ 21 175) "4.3.2 Existence as a minor subject")
;; (find-gnomesinthefogpage (+ 21 183) "4.4 Later reactions")
;; (find-gnomesinthefogpage (+ 21 183) "4.4.1 The Konigsberg conference")
;; (find-gnomesinthefogpage (+ 21 190) "4.4.2 Wittgenstein")
;; (find-gnomesinthefogpage (+ 21 198) "4.4.3 Others")
;; (find-gnomesinthefogpage (+ 21 212) "4.5 Conclusion")
;; (find-gnomesinthefogpage (+ 20 217) "5 Reactions: logic and the excluded middle")
;; (find-gnomesinthefogpage (+ 20 217) "5.1 Introduction")
;; (find-gnomesinthefogpage (+ 20 218) "5.1.1 A short history of classical logic")
;; (find-gnomesinthefogpage (+ 20 220) "5.2 The beginning of the debate")
;; (find-gnomesinthefogpage (+ 20 222) "5.2.1 Weyl's Grundlagenkrise")
;; (find-gnomesinthefogpage (+ 20 225) "5.2.2 Hilbert's first reactions")
;; (find-gnomesinthefogpage (+ 20 229) "5.2.3 Addresses: Wolff, Finsler and Baldus")
;; (find-gnomesinthefogpage (+ 20 231) "5.2.4 Fraenkel's early commentaries.")
;; (find-gnomesinthefogpage (+ 20 231) "5.3 The debate widened")
;; (find-gnomesinthefogpage (+ 20 236) "5.3.1 The excluded middle in a central position")
;; (find-gnomesinthefogpage (+ 20 268) "5.3.2 The excluded middle as a minor subject")
;; (find-gnomesinthefogpage (+ 20 271) "5.4 Later reactions")
;; (find-gnomesinthefogpage (+ 20 271) "5.4.1 Glivenko, Heyting and Kolmogorov")
;; (find-gnomesinthefogpage (+ 20 281) "5.4.2 Godel")
;; (find-gnomesinthefogpage (+ 20 289) "5.4.3 Barzin and Errera")
;; (find-gnomesinthefogpage (+ 20 296) "5.5 Conclusion")
;; (find-gnomesinthefogpage (+ 19 301) "6 The foundational crisis in its context")
;; (find-gnomesinthefogpage (+ 19 301) "6.1 Introduction")
;; (find-gnomesinthefogpage (+ 19 302) "6.2 Metaphors")
;; (find-gnomesinthefogpage (+ 19 302) "6.2.1 Crisis and revolution")
;; (find-gnomesinthefogpage (+ 19 311) "6.3 Philosophy")
;; (find-gnomesinthefogpage (+ 19 312) "6.3.1 Lebensphilosophie")
;; (find-gnomesinthefogpage (+ 19 316) "6.3.2 Mathematical and philosophical intuitionism: a comparison")
;; (find-gnomesinthefogpage (+ 19 320) "6.3.3 Contemporaries' remarks")
;; (find-gnomesinthefogpage (+ 19 322) "6.3.4 Gottingen and Hilbert")
;; (find-gnomesinthefogpage (+ 19 323) "6.3.5 Spengler")
;; (find-gnomesinthefogpage (+ 19 325) "6.3.6 Summary")
;; (find-gnomesinthefogpage (+ 19 326) "6.4 Physics")
;; (find-gnomesinthefogpage (+ 19 327) "6.4.1 Theory of relativity")
;; (find-gnomesinthefogpage (+ 19 329) "6.4.2 Quantum mechanics")
;; (find-gnomesinthefogpage (+ 19 333) "6.5 Art")
;; (find-gnomesinthefogpage (+ 19 334) "6.5.1 Constructivism...")
;; (find-gnomesinthefogpage (+ 19 335) "6.6 Politics")
;; (find-gnomesinthefogpage (+ 19 335) "6.6.1 Mathematics and the rise of the Third Reich")
;; (find-gnomesinthefogpage (+ 19 338) "6.6.2 Bieberbach's racial interpretation of the foundational debate")
;; (find-gnomesinthefogpage (+ 19 340) "6.7 Modeme and Gegenmodeme.")
;; (find-gnomesinthefogpage (+ 19 342) "6.8 Conclusion")
;; (find-gnomesinthefogpage (+ 19 345) "Conclusion")
;; (find-gnomesinthefogpage (+ 19 355) "A Chronology of the debate")
;; (find-gnomesinthefogpage (+ 18 363) "B Public reactions to Brouwer's intuitionism")
;; (find-gnomesinthefogpage (+ 17 371) "C Logical notations")
;; (find-gnomesinthefogpage (+ 16 373) "Glossary")
;; (find-gnomesinthefogpage (+ 16 377) "Bibliography")
;; (find-gnomesinthefogtext (+ 16 377) "Bibliography")
;; (find-gnomesinthefogpage (+ 16 431) "Index")
;; (find-gnomesinthefogpage (+ 15 445) "Acknowledgements")
;; (find-gnomesinthefogtext "")
;; «heyting» (to ".heyting")
;; (find-books "__logic/__logic.el" "heyting")
(code-pdf-page "heytingii" "~/books/__logic/heyting__intuitionism_an_introduction.pdf")
(code-pdf-text "heytingii" "~/books/__logic/heyting__intuitionism_an_introduction.pdf" 12)
;; (find-heytingiipage)
;; (find-heytingiipage 7 "Contents")
;; (find-heytingiitext 7 "Contents")
;; (find-heytingiipage (+ 12 1) "Index")
;; (find-heytingiipage (+ 11 143) "Index")
;; (find-heytingiitext "")
;; «hindley» (to ".hindley")
;; (find-books "__logic/__logic.el" "hindley")
;; http://www.users.waitrose.com/~hindley/
(code-pdf "hindleyseldin2" "~/books/__logic/hindley_seldin__lambda-calculus_and_combinators_2nd_ed.pdf")
(code-pdftotext "hindleyseldin2" "~/books/__logic/hindley_seldin__lambda-calculus_and_combinators_2nd_ed.pdf" 14)
;; (find-hindleyseldin2page)
;; (find-hindleyseldin2page 8 "Contents")
;; (find-hindleyseldin2page (+ 14 107) "10 Simple typing, Church-style")
;; (find-hindleyseldin2page (+ 14 147) "11J Propositions-as-types and normalization")
;; (find-hindleyseldin2page (+ 14 334) "List of symbols")
;; (find-hindleyseldin2page (+ 14 337) "Index")
;; (find-hindleyseldin2text "")
(code-pdf-page "hindleybstt" "~/books/__logic/hindley__basic_simple_type_theory.pdf")
(code-pdf-text "hindleybstt" "~/books/__logic/hindley__basic_simple_type_theory.pdf" 13)
;; (find-hindleybsttpage)
;; (find-hindleybsttpage 8 "Contents")
;; (find-hindleybsttpage (+ 13 1) "1 The type-free A-calculus")
;; (find-hindleybsttpage (+ 13 4) "1B /3-reduction and #-normal forms")
;; (find-hindleybsttpage (+ 13 7) "1C ri- and fn-reductions")
;; (find-hindleybsttpage (+ 13 10) "1D Restricted 2-terms")
;; (find-hindleybsttpage (+ 13 12) "2 Assigning types to terms")
;; (find-hindleybsttpage (+ 13 12) "2A The system TAA")
;; (find-hindleybsttpage (+ 13 20) "2B The subject-construction theorem")
;; (find-hindleybsttpage (+ 13 24) "2C Subject reduction and expansion")
;; (find-hindleybsttpage (+ 13 27) "2D The typable terms")
;; (find-hindleybsttpage (+ 13 30) "3 The principal-type algorithm")
;; (find-hindleybsttpage (+ 13 31) "3A Principal types and their history")
;; (find-hindleybsttpage (+ 13 34) "3B Type-substitutions")
;; (find-hindleybsttpage (+ 13 38) "3C Motivating the PT algorithm")
;; (find-hindleybsttpage (+ 13 40) "3D Unification")
;; (find-hindleybsttpage (+ 13 44) "3E The PT algorithm")
;; (find-hindleybsttpage (+ 13 52) "4 Type assignment with equality")
;; (find-hindleybsttpage (+ 13 52) "4A The equality rule")
;; (find-hindleybsttpage (+ 13 57) "4B Semantics and completeness")
;; (find-hindleybsttpage (+ 13 63) "5 A version using typed terms")
;; (find-hindleybsttpage (+ 13 63) "5A Typed terms")
;; (find-hindleybsttpage (+ 13 67) "5B Reducing typed terms")
;; (find-hindleybsttpage (+ 13 71) "5C Normalization theorems")
;; (find-hindleybsttpage (+ 13 74) "6 The correspondence with implication")
;; (find-hindleybsttpage (+ 13 74) "6A Intuitionist implicational logic")
;; (find-hindleybsttpage (+ 13 79) "6B The Curry-Howard isomorphism")
;; (find-hindleybsttpage (+ 13 85) "6C Some weaker logics")
;; (find-hindleybsttpage (+ 13 88) "6D Axiom-based versions")
;; (find-hindleybsttpage (+ 13 93) "7 The converse principal-type algorithm")
;; (find-hindleybsttpage (+ 13 93) "7A The converse PT theorems")
;; (find-hindleybsttpage (+ 13 95) "7B Identifications")
;; (find-hindleybsttpage (+ 13 96) "7C The converse PT proof")
;; (find-hindleybsttpage (+ 13 102) "7D Condensed detachment")
;; (find-hindleybsttpage (+ 13 108) "8 Counting a type's inhabitants")
;; (find-hindleybsttpage (+ 13 108) "8A Inhabitants")
;; (find-hindleybsttpage (+ 13 114) "8B Examples of the search strategy")
;; (find-hindleybsttpage (+ 13 118) "8C The search algorithm")
;; (find-hindleybsttpage (+ 13 124) "8D The Counting algorithm")
;; (find-hindleybsttpage (+ 13 127) "8E The structure of a nf-scheme")
;; (find-hindleybsttpage (+ 13 132) "8F Stretching, shrinking and completeness")
;; (find-hindleybsttpage (+ 13 140) "9 Technical details")
;; (find-hindleybsttpage (+ 13 140) "9A The structure of a term")
;; (find-hindleybsttpage (+ 13 144) "9B Residuals")
;; (find-hindleybsttpage (+ 13 148) "9C The structure of a TA2-deduction")
;; (find-hindleybsttpage (+ 13 151) "9D The structure of a type")
;; (find-hindleybsttpage (+ 13 153) "9E The condensed structure of a type")
;; (find-hindleybsttpage (+ 13 157) "9F Imitating combinatory logic in A-calculus")
;; (find-hindleybsttpage (+ 13 161) "Answers to starred exercises")
;; (find-hindleybsttpage (+ 13 169) "Bibliography")
;; (find-hindleybsttpage (+ 13 177) "Table of principal types")
;; (find-hindleybsttpage (+ 13 179) "Index")
;; (find-hindleybstttext "")
;; «hindley-seldin2» (to ".hindley-seldin2")
;; (find-books "__logic/__logic.el" "hindley-seldin2")
(code-pdf-page "hindleyseldin2" "~/books/__logic/hindley_seldin__lambda-calculus_and_combinators_an_introduction.pdf")
(code-pdf-text "hindleyseldin2" "~/books/__logic/hindley_seldin__lambda-calculus_and_combinators_an_introduction.pdf" 14)
;; (find-hindleyseldin2page)
;; (find-hindleyseldin2page 8 "Contents")
;; (find-hindleyseldin2page 11 "Preface")
;; (find-hindleyseldin2page (+ 1 189) "Index")
;; (find-hindleyseldin2text "")
;; (find-hindleyseldin2page (+ 14 1) "1 The -calculus")
;; (find-hindleyseldin2page (+ 14 1) "1A Introduction")
;; (find-hindleyseldin2page (+ 14 3) "will be called pure")
;; (find-hindleyseldin2page (+ 14 5) "1B Term-structure and substitution")
;; (find-hindleyseldin2page (+ 14 11) "1C -reduction")
;; (find-hindleyseldin2page (+ 14 16) "1D -equality")
;; (find-hindleyseldin2page (+ 14 21) "2 Combinatory logic")
;; (find-hindleyseldin2page (+ 14 21) "without using bound variables")
;; (find-hindleyseldin2page (+ 14 21) "2A Introduction to CL")
;; (find-hindleyseldin2page (+ 14 24) "2B Weak reduction")
;; (find-hindleyseldin2page (+ 14 26) "2C Abstraction in CL")
;; (find-hindleyseldin2page (+ 14 29) "2D Weak equality")
;; (find-hindleyseldin2page (+ 14 33) "3 The power of and combinators")
;; (find-hindleyseldin2page (+ 14 33) "3A Introduction")
;; (find-hindleyseldin2page (+ 14 34) "3B The fixed-point theorem")
;; (find-hindleyseldin2page (+ 14 36) "3C B¨ohm's theorem")
;; (find-hindleyseldin2page (+ 14 40) "3D The quasi-leftmost-reduction theorem")
;; (find-hindleyseldin2page (+ 14 43) "3E History and interpretation")
;; (find-hindleyseldin2page (+ 14 47) "4 Representing the computable functions")
;; (find-hindleyseldin2page (+ 14 47) "4A Introduction")
;; (find-hindleyseldin2page (+ 14 48) "Definition 4.2 (The Church numerals)")
;; (find-hindleyseldin2text (+ 14 48) "Definition 4.2 (The Church numerals)")
;; (find-hindleyseldin2page (+ 14 50) "4B Primitive recursive functions")
;; (find-hindleyseldin2page (+ 14 56) "4C Recursive functions")
;; (find-hindleyseldin2page (+ 14 61) "4D Abstract numerals and Z")
;; (find-hindleyseldin2page (+ 14 63) "5 The undecidability theorem")
;; (find-hindleyseldin2page (+ 14 69) "6 The formal theories and CLw")
;; (find-hindleyseldin2page (+ 14 69) "6A The definitions of the theories")
;; (find-hindleyseldin2page (+ 14 72) "6B First-order theories")
;; (find-hindleyseldin2page (+ 14 73) "6C Equivalence of theories")
;; (find-hindleyseldin2page (+ 14 76) "7 Extensionality in -calculus")
;; (find-hindleyseldin2page (+ 14 76) "7A Extensional equality")
;; (find-hindleyseldin2page (+ 14 79) "7B -reduction in -calculus")
;; (find-hindleyseldin2page (+ 14 82) "8 Extensionality in combinatory logic")
;; (find-hindleyseldin2page (+ 14 82) "8A Extensional equality")
;; (find-hindleyseldin2page (+ 14 85) "8B Axioms for extensionality in CL")
;; (find-hindleyseldin2page (+ 14 89) "8C Strong reduction")
;; (find-hindleyseldin2page (+ 14 92) "9 Correspondence between and CL")
;; (find-hindleyseldin2page (+ 14 92) "9A Introduction")
;; (find-hindleyseldin2page (+ 14 95) "9B The extensional equalities")
;; (find-hindleyseldin2page (+ 14 100) "9C New abstraction algorithms in CL")
;; (find-hindleyseldin2page (+ 14 102) "9D Combinatory -equality")
;; (find-hindleyseldin2page (+ 14 107) "10 Simple typing, Church-style")
;; (find-hindleyseldin2page (+ 14 107) "10A Simple types")
;; (find-hindleyseldin2page (+ 14 109) "10B Typed -calculus")
;; (find-hindleyseldin2page (+ 14 115) "10C Typed CL")
;; (find-hindleyseldin2page (+ 14 119) "11 Simple typing, Curry-style in CL")
;; (find-hindleyseldin2page (+ 14 119) "11A Introduction")
;; (find-hindleyseldin2page (+ 14 122) "11B The system TA C")
;; (find-hindleyseldin2page (+ 14 126) "11C Subject-construction")
;; (find-hindleyseldin2page (+ 14 127) "11D Abstraction")
;; (find-hindleyseldin2page (+ 14 130) "11E Subject-reduction")
;; (find-hindleyseldin2page (+ 14 134) "11F Typable CL-terms")
;; (find-hindleyseldin2page (+ 14 137) "11G Link with Church's approach")
;; (find-hindleyseldin2page (+ 14 138) "11H Principal types")
;; (find-hindleyseldin2page (+ 14 143) "11I Adding new axioms")
;; (find-hindleyseldin2page (+ 14 147) "11J Propositions-as-types and normalization")
;; (find-hindleyseldin2page (+ 14 155) "11K The equality-rule Eq")
;; (find-hindleyseldin2page (+ 14 159) "12 Simple typing, Curry-style in")
;; (find-hindleyseldin2page (+ 14 159) "12A The system TA")
;; (find-hindleyseldin2page (+ 14 165) "12B Basic properties of TA")
;; (find-hindleyseldin2page (+ 14 170) "12C Typable -terms")
;; (find-hindleyseldin2page (+ 14 173) "12D Propositions-as-types and normalization")
;; (find-hindleyseldin2page (+ 14 176) "12E The equality-rule Eq")
;; (find-hindleyseldin2page (+ 14 180) "13 Generalizations of typing")
;; (find-hindleyseldin2page (+ 14 180) "13A Introduction")
;; (find-hindleyseldin2page (+ 14 181) "13B Dependent function types, introduction")
;; (find-hindleyseldin2page (+ 14 183) "13C Basic generalized typing, Curry-style in")
;; (find-hindleyseldin2page (+ 14 187) "13D Deductive rules to define types")
;; (find-hindleyseldin2page (+ 14 191) "13E Church-style typing in")
;; (find-hindleyseldin2page (+ 14 192) "Definition 13.23 (-cube)")
;; (find-hindleyseldin2text (+ 14 192) "Definition 13.23 (-cube)")
;; (find-hindleyseldin2page (+ 14 202) "13F Normalization in PTSs")
;; (find-hindleyseldin2page (+ 14 209) "13G Propositions-as-types")
;; (find-hindleyseldin2page (+ 14 210) "pairing and projection operators")
;; (find-hindleyseldin2text (+ 14 210) "pairing and projection operators")
;; (find-hindleyseldin2page (+ 14 217) "13H PTSs with equality")
;; (find-hindleyseldin2page (+ 14 220) "14 Models of CL")
;; (find-hindleyseldin2page (+ 14 220) "14A Applicative structures")
;; (find-hindleyseldin2page (+ 14 223) "14B Combinatory algebras")
;; (find-hindleyseldin2page (+ 14 229) "15 Models of -calculus")
;; (find-hindleyseldin2page (+ 14 229) "15A The definition of -model")
;; (find-hindleyseldin2page (+ 14 236) "15B Syntax-free definitions")
;; (find-hindleyseldin2page (+ 14 242) "15C General properties of -models")
;; (find-hindleyseldin2page (+ 14 247) "16 Scott's D and other models")
;; (find-hindleyseldin2page (+ 14 247) "16A Introduction: complete partial orders")
;; (find-hindleyseldin2page (+ 14 252) "16B Continuous functions")
;; (find-hindleyseldin2page (+ 14 256) "16C The construction of D")
;; (find-hindleyseldin2page (+ 14 261) "16D Basic properties of D")
;; (find-hindleyseldin2page (+ 14 267) "16E D is a -model")
;; (find-hindleyseldin2page (+ 14 271) "16F Some other models")
;; (find-hindleyseldin2page (+ 14 276) "Appendix A1 Bound variables and -conversion")
;; (find-hindleyseldin2page (+ 14 282) "Appendix A2 Confluence proofs")
;; (find-hindleyseldin2page (+ 14 293) "Appendix A3 Strong normalization proofs")
;; (find-hindleyseldin2page (+ 14 305) "Appendix A4 Care of your pet combinator")
;; (find-hindleyseldin2page (+ 14 307) "Appendix A5 Answers to starred exercises")
;; (find-hindleyseldin2page (+ 14 323) "References")
;; (find-hindleyseldin2page (+ 14 334) "List of symbols")
;; (find-hindleyseldin2page (+ 14 337) "Index")
;; (find-hindleyseldin2page (+ 14 339) "deduction")
;; (find-hindleyseldin2text )
;; «hintikka» (to ".hintikka")
;; http://gigapedia.com/items/35756/the-philosophy-of-mathematics--oxford-readings-in-philosophy-
(code-djvu "hintikkaphilmat" "~/books/__logic/hintikka_ed__the_philosophy_of_mathematics.djvu")
;; (find-hintikkaphilmatpage 176 "Contents")
;; (find-hintikkaphilmatpage (+ 176 1) "Introduction")
;; (find-hintikkaphilmatpage (+ 176 9) "I. Semantic entailment and formal derivability" "E.W. Beth")
;; (find-hintikkaphilmatpage (+ -12 14) "I. 3. Heuristic considerations")
;; (find-hintikkaphilmatpage (+ -12 42) "II. The completeness of the first-order functional calculus" "Leon Henkin")
;; (find-hintikkaphilmatpage (+ -12 95) "VI. Systems of predicative analysis" "Solomon Feferman")
;; «hofstadter» (to ".hofstadter")
(code-xpdf "geb" "~/books/__logic/hofstadter__godel_escher_bach_an_eternal_golden_braid.pdf")
(code-pdftotext "geb" "~/books/__logic/hofstadter__godel_escher_bach_an_eternal_golden_braid.pdf" 0)
;; (ee-page-parameters "geb" 0)
;; (find-gebpage 1 "Contents")
;; (find-gebpage 193 "The Converse of the Fantasy Rule")
;; (find-gebtext 193 "The Converse of the Fantasy Rule")
;; (find-gebpage (+ 9 761) "Index")
;; (find-gebtext "")
;; «howard» (to ".howard")
;; (find-books "__logic/__logic.el" "howard")
;; (find-LATEX "catsem-u.bib" "bib-Howard")
;; https://www.cs.cmu.edu/~crary/819-f09/Howard80.pdf
;; (find-fline "$S/https/www.cs.cmu.edu/~crary/819-f09/")
(code-pdf-page "howard80" "$S/https/www.cs.cmu.edu/~crary/819-f09/Howard80.pdf")
(code-pdf-text "howard80" "$S/https/www.cs.cmu.edu/~crary/819-f09/Howard80.pdf" -478)
;; (find-howard80page)
;; (find-howard80text)
;; (find-howard80page (+ -478 479))
;; (find-howard80page (+ -478 479) "I. Intuitionistic propositional calculus")
;; (find-howard80page (+ -478 480) "1. Formulation of the sequent calculus")
;; (find-howard80page (+ -478 480) "2. Type symbols, terms and constructions")
;; (find-howard80page (+ -478 481) "3. Correspondence between derivations and terms")
;; (find-howard80page (+ -478 481) "4. Interpretation of terms")
;; (find-howard80page (+ -478 482) "Lauchli")
;; (find-howard80page (+ -478 482) "5. Normalization of terms and cut elimination")
;; (find-howard80page (+ -478 483) "6. Addition of not, and, and or to P(->)")
;; (find-howard80page (+ -478 484) "II. Heyting Arithmetic")
;; (find-howard80page (+ -478 485) "7. Constructions")
;; (find-howard80page (+ -478 485) "8. Special terms")
;; (find-howard80page (+ -478 486) "9. Constructions and derivations in H(imp, and, Fa)")
;; (find-howard80page (+ -478 486) "10. Interpretation of terms of H(imp, and, Fa)")
;; (find-howard80page (+ -478 487) "11. Normalization of terms")
;; (find-howard80page (+ -478 488) "12. Introduction of Ex")
;; (find-howard80page (+ -478 489) "13. Infinite constructions")
;; (find-howard80page (+ -478 490) "References")
;; «hott» (to ".hott")
;; (find-books "__logic/__logic.el" "hott")
;; (find-LATEX "catsem-u.bib" "bib-HOTT")
;; https://homotopytypetheory.org/book/
;; https://hott.github.io/book/
;; https://hott.github.io/book/nightly/hott-online-1204-g7415493.pdf
;; http://saunders.phil.cmu.edu/book/hott-online.pdf
(code-pdf-page "hott" "$S/https/hott.github.io/book/nightly/hott-online-1204-g7415493.pdf")
(code-pdf-text "hott" "$S/https/hott.github.io/book/nightly/hott-online-1204-g7415493.pdf" 12)
(code-pdf-page "hott" "$S/http/saunders.phil.cmu.edu/book/hott-online.pdf")
(code-pdf-text "hott" "$S/http/saunders.phil.cmu.edu/book/hott-online.pdf" 12)
;; (find-hottpage)
;; (find-hotttext)
;; (find-hottpage 7 "Contents")
;; (find-hotttext 7 "Contents")
;; (find-hottpage (+ 12 1) "Introduction")
;; (find-hottpage (+ 12 6) "small object argument")
;; (find-hotttext (+ 12 6) "small object argument")
;; (find-hottpage (+ 12 15) "I Foundations")
;; (find-hottpage (+ 12 17) "1 Type theory")
;; (find-hottpage (+ 12 17) "1.1 Type theory versus set theory")
;; (find-hottpage (+ 12 18) "a witness to the provability of A")
;; (find-hotttext (+ 12 18) "a witness to the provability of A")
;; (find-hottpage (+ 12 21) "1.2 Function types")
;; (find-hottpage (+ 12 23) "this means that y gets captured")
;; (find-hotttext (+ 12 23) "this means that y gets captured")
;; (find-hottpage (+ 12 24) "1.3 Universes and families")
;; (find-hottpage (+ 12 25) "1.4 Dependent function types (-types)")
;; (find-hottpage (+ 12 26) "1.5 Product types")
;; (find-hottpage (+ 12 30) "1.6 Dependent pair types (-types)")
;; (find-hottpage (+ 12 33) "1.7 Coproduct types")
;; (find-hottpage (+ 12 35) "1.8 The type of booleans")
;; (find-hottpage (+ 12 36) "1.9 The natural numbers")
;; (find-hottpage (+ 12 40) "1.10 Pattern matching and recursion")
;; (find-hottpage (+ 12 41) "1.11 Propositions as types")
;; (find-hottpage (+ 12 47) "1.12 Identity types")
;; (find-hottpage (+ 12 54) "Notes")
;; (find-hottpage (+ 12 56) "Exercises")
;; (find-hottpage (+ 12 59) "2 Homotopy type theory")
;; (find-hottpage (+ 12 62) "2.1 Types are higher groupoids")
;; (find-hottpage (+ 12 71) "2.2 Functions are functors")
;; (find-hottpage (+ 12 72) "2.3 Type families are fibrations")
;; (find-hottpage (+ 12 76) "2.4 Homotopies and equivalences")
;; (find-hottpage (+ 12 79) "2.5 The higher groupoid structure of type formers")
;; (find-hottpage (+ 12 81) "2.6 Cartesian product types")
;; (find-hottpage (+ 12 83) "2.7 -types")
;; (find-hottpage (+ 12 86) "2.8 The unit type")
;; (find-hottpage (+ 12 86) "2.9 -types and the function extensionality axiom")
;; (find-hottpage (+ 12 89) "2.10 Universes and the univalence axiom")
;; (find-hottpage (+ 12 91) "2.11 Identity type")
;; (find-hottpage (+ 12 93) "2.12 Coproducts")
;; (find-hottpage (+ 12 95) "2.13 Natural numbers")
;; (find-hottpage (+ 12 97) "2.14 Example: equality of structures")
;; (find-hottpage (+ 12 100) "2.15 Universal properties")
;; (find-hottpage (+ 12 102) "Notes")
;; (find-hottpage (+ 12 104) "Exercises")
;; (find-hottpage (+ 12 107) "3 Sets and logic")
;; (find-hottpage (+ 12 107) "3.1 Sets and n-types")
;; (find-hottpage (+ 12 109) "3.2 Propositions as types?")
;; (find-hotttext (+ 12 109) "Propositions as types?")
;; (find-hottpage (+ 12 111) "3.3 Mere propositions")
;; (find-hottpage (+ 12 113) "3.4 Classical vs. intuitionistic logic")
;; (find-hottpage (+ 12 114) "3.5 Subsets and propositional resizing")
;; (find-hottpage (+ 12 116) "3.6 The logic of mere propositions")
;; (find-hottpage (+ 12 117) "3.7 Propositional truncation")
;; (find-hottpage (+ 12 118) "3.8 The axiom of choice")
;; (find-hottpage (+ 12 120) "3.9 The principle of unique choice")
;; (find-hottpage (+ 12 121) "3.10 When are propositions truncated?")
;; (find-hottpage (+ 12 123) "3.11 Contractibility")
;; (find-hottpage (+ 12 126) "Notes")
;; (find-hottpage (+ 12 127) "Exercises")
;; (find-hottpage (+ 12 129) "4 Equivalences")
;; (find-hottpage (+ 12 130) "4.1 Quasi-inverses")
;; (find-hottpage (+ 12 132) "4.2 Half adjoint equivalences")
;; (find-hottpage (+ 12 136) "4.3 Bi-invertible maps")
;; (find-hottpage (+ 12 136) "4.4 Contractible fibers")
;; (find-hottpage (+ 12 138) "4.5 On the definition of equivalences")
;; (find-hottpage (+ 12 138) "4.6 Surjections and embeddings")
;; (find-hottpage (+ 12 139) "4.7 Closure properties of equivalences")
;; (find-hottpage (+ 12 142) "4.8 The object classifier")
;; (find-hottpage (+ 12 144) "4.9 Univalence implies function extensionality")
;; (find-hottpage (+ 12 146) "Notes")
;; (find-hottpage (+ 12 146) "Exercises")
;; (find-hottpage (+ 12 149) "5 Induction")
;; (find-hottpage (+ 12 149) "5.1 Introduction to inductive types")
;; (find-hottpage (+ 12 152) "5.2 Uniqueness of inductive types")
;; (find-hottpage (+ 12 154) "5.3 W-types")
;; (find-hottpage (+ 12 157) "5.4 Inductive types are initial algebras")
;; (find-hottpage (+ 12 160) "5.5 Homotopy-inductive types")
;; (find-hottpage (+ 12 164) "5.6 The general syntax of inductive definitions")
;; (find-hottpage (+ 12 168) "5.7 Generalizations of inductive types")
;; (find-hottpage (+ 12 170) "5.8 Identity types and identity systems")
;; (find-hottpage (+ 12 174) "Notes")
;; (find-hottpage (+ 12 175) "Exercises")
;; (find-hottpage (+ 12 179) "6 Higher inductive types")
;; (find-hottpage (+ 12 179) "6.1 Introduction")
;; (find-hottpage (+ 12 181) "6.2 Induction principles and dependent paths")
;; (find-hottpage (+ 12 186) "6.3 The interval")
;; (find-hottpage (+ 12 187) "6.4 Circles and spheres")
;; (find-hottpage (+ 12 189) "6.5 Suspensions")
;; (find-hottpage (+ 12 192) "6.6 Cell complexes")
;; (find-hottpage (+ 12 194) "6.7 Hubs and spokes")
;; (find-hottpage (+ 12 195) "6.8 Pushouts")
;; (find-hottpage (+ 12 198) "6.9 Truncations")
;; (find-hottpage (+ 12 201) "6.10 Quotients")
;; (find-hottpage (+ 12 206) "6.11 Algebra")
;; (find-hottpage (+ 12 211) "6.12 The flattening lemma")
;; (find-hottpage (+ 12 216) "6.13 The general syntax of higher inductive definitions")
;; (find-hottpage (+ 12 218) "Notes")
;; (find-hottpage (+ 12 219) "Exercises")
;; (find-hottpage (+ 12 221) "7 Homotopy n-types")
;; (find-hottpage (+ 12 221) "7.1 Definition of n-types")
;; (find-hottpage (+ 12 225) "7.2 Uniqueness of identity proofs and Hedberg's theorem")
;; (find-hottpage (+ 12 228) "7.3 Truncations")
;; (find-hottpage (+ 12 234) "7.4 Colimits of n-types")
;; (find-hottpage (+ 12 238) "7.5 Connectedness")
;; (find-hottpage (+ 12 243) "7.6 Orthogonal factorization")
;; (find-hottpage (+ 12 248) "7.7 Modalities")
;; (find-hottpage (+ 12 252) "Notes")
;; (find-hottpage (+ 12 253) "Exercises")
;; (find-hottpage (+ 12 257) "II Mathematics")
;; (find-hottpage (+ 12 259) "8 Homotopy theory")
;; (find-hottpage (+ 12 263) "8.1 1 (S1 )")
;; (find-hottpage (+ 12 271) "8.2 Connectedness of suspensions")
;; (find-hottpage (+ 12 272) "8.3 kn of an n-connected space and k<n (Sn )")
;; (find-hottpage (+ 12 273) "8.4 Fiber sequences and the long exact sequence")
;; (find-hottpage (+ 12 277) "8.5 The Hopf fibration")
;; (find-hottpage (+ 12 283) "8.6 The Freudenthal suspension theorem")
;; (find-hottpage (+ 12 289) "8.7 The van Kampen theorem")
;; (find-hottpage (+ 12 298) "8.8 Whitehead's theorem and Whitehead's principle")
;; (find-hottpage (+ 12 302) "8.9 A general statement of the encode-decode method")
;; (find-hottpage (+ 12 303) "8.10 Additional Results")
;; (find-hottpage (+ 12 304) "Notes")
;; (find-hottpage (+ 12 306) "Exercises")
;; (find-hottpage (+ 12 307) "9 Category theory")
;; (find-hottpage (+ 12 308) "9.1 Categories and precategories")
;; (find-hottpage (+ 12 311) "9.2 Functors and transformations")
;; (find-hottpage (+ 12 315) "9.3 Adjunctions")
;; (find-hottpage (+ 12 316) "9.4 Equivalences")
;; (find-hottpage (+ 12 322) "9.5 The Yoneda lemma")
;; (find-hottpage (+ 12 325) "9.6 Strict categories")
;; (find-hottpage (+ 12 326) "9.7 -categories")
;; (find-hottpage (+ 12 327) "9.8 The structure identity principle")
;; (find-hottpage (+ 12 330) "9.9 The Rezk completion")
;; (find-hottpage (+ 12 337) "Notes")
;; (find-hottpage (+ 12 338) "Exercises")
;; (find-hottpage (+ 12 341) "10 Set theory")
;; (find-hottpage (+ 12 341) "10.1 The category of sets")
;; (find-hottpage (+ 12 350) "10.2 Cardinal numbers")
;; (find-hottpage (+ 12 353) "10.3 Ordinal numbers")
;; (find-hottpage (+ 12 360) "10.4 Classical well-orderings")
;; (find-hottpage (+ 12 362) "10.5 The cumulative hierarchy")
;; (find-hottpage (+ 12 368) "Notes")
;; (find-hottpage (+ 12 368) "Exercises")
;; (find-hottpage (+ 12 373) "11 Real numbers")
;; (find-hottpage (+ 12 374) "11.1 The field of rational numbers")
;; (find-hottpage (+ 12 374) "11.2 Dedekind reals")
;; (find-hottpage (+ 12 381) "11.3 Cauchy reals")
;; (find-hottpage (+ 12 400) "11.4 Comparison of Cauchy and Dedekind reals")
;; (find-hottpage (+ 12 401) "11.5 Compactness of the interval")
;; (find-hottpage (+ 12 407) "11.6 The surreal numbers")
;; (find-hottpage (+ 12 419) "Notes")
;; (find-hottpage (+ 12 420) "Exercises")
;; (find-hottpage (+ 12 423) "Appendix")
;; (find-hottpage (+ 12 425) "A Formal type theory")
;; (find-hottpage (+ 12 427) "A.1 The first presentation")
;; (find-hottpage (+ 12 431) "A.2 The second presentation")
;; (find-hottpage (+ 12 437) "A.3 Homotopy type theory")
;; (find-hottpage (+ 12 439) "A.4 Basic metatheory")
;; (find-hottpage (+ 12 440) "Notes")
;; (find-hottpage (+ 12 442) "Bibliography")
;; (find-hottpage (+ 12 451) "Index of symbols")
;; (find-hottpage (+ 12 457) "Index")
;; (find-hotttext (+ 12 457) "Index")
;; (find-hottpage (+ 12 467) "proof-relevant")
;; (find-hotttext (+ 12 467) "proof-relevant")
;; «hrbacek-jech» (to ".hrbacek-jech")
;; (find-books "__logic/__logic.el" "hrbacek-jech")
(code-pdf-page "hrbacekjech" "~/books/__logic/hrbaceck_jech__introduction_to_set_theory.pdf")
(code-pdf-text "hrbacekjech" "~/books/__logic/hrbaceck_jech__introduction_to_set_theory.pdf" 1)
;; (find-hrbacekjechpage)
;; (find-hrbacekjechpage 14 "Contents")
;; (find-hrbacekjechpage (+ 19 86) "Index")
;; (find-hrbacekjechtext "")
;; «humberstone» (to ".humberstone")
;; (find-books "__logic/__logic.el" "humberstone")
(code-pdf "connectives" "~/books/__logic/humberstone__the_connectives.pdf")
(code-pdftotext "connectives" "~/books/__logic/humberstone__the_connectives.pdf" 19)
;; (find-connectivespage)
;; (find-connectivespage 8 "Contents")
;; (find-connectivespage 14 "Preface")
;; (find-connectivespage (+ 19 1) "0. Preliminaries")
;; (find-connectivespage (+ 19 47) "1 Elements of Sentential Logic")
;; (find-connectivespage (+ 19 47) "1.1 TRUTH AND CONSEQUENCE")
;; (find-connectivespage (+ 19 47) "1.11 Languages")
;; (find-connectivespage (+ 19 54) "1.12 Consequence Relations and Valuations")
;; (find-connectivespage (+ 19 61) "1.13 #-Classical Consequence Relations and #-Boolean Valuations")
;; (find-connectivespage (+ 19 67) "1.14 Forcing Consistent Valuations to Be #-Boolean")
;; (find-connectivespage (+ 19 72) "1.15 Two Equations and the `Converse Proposition' Fallacy")
;; (find-connectivespage (+ 19 73) "1.16 Generalized Consequence Relations")
;; (find-connectivespage (+ 19 79) "1.17 Generalized Consequence Relations: Supplementary Discussion")
;; (find-connectivespage (+ 19 82) "1.18 Truth-Tables, and Two More Connectives: Implication and Equivalence")
;; (find-connectivespage (+ 19 87) "1.19 A More Hygienic Terminology")
;; (find-connectivespage (+ 19 100) "Notes and References for §1.1")
;; (find-connectivespage (+ 19 103) "1.2 RULES AND PROOF")
;; (find-connectivespage (+ 19 103) "1.21 Sequents and Frameworks")
;; (find-connectivespage (+ 19 112) "1.22 Sequents and (Generalized) Consequence Relations")
;; (find-connectivespage (+ 19 114) "1.23 A Sample Natural Deduction System in Set-Fmla")
;; (find-connectivespage (+ 19 122) "1.24 A Closer Look at Rules")
;; (find-connectivespage (+ 19 127) "1.25 Semantic Apparatus for Sequents and for Rules")
;; (find-connectivespage (+ 19 132) "1.26 Two Relational Connections")
;; (find-connectivespage (+ 19 140) "1.27 Sample Natural Deduction and Sequent Calculus Systems in Set-Set")
;; (find-connectivespage (+ 19 150) "1.28 Some Other Approaches to Logic in Set-Set")
;; (find-connectivespage (+ 19 156) "1.29 Axiom Systems and the Deduction Theorem")
;; (find-connectivespage (+ 19 180) "Appendix to §1.2: What Is a Logic?")
;; (find-connectivespage (+ 19 188) "Notes and References for §1.2")
;; (find-connectivespage (+ 19 195) "2 A Survey of Sentential Logic")
;; (find-connectivespage (+ 19 195) "2.1 MANY-VALUED LOGIC AND ALGEBRAIC SEMANTICS")
;; (find-connectivespage (+ 19 195) "2.11 Many-Valued Logic: Matrices")
;; (find-connectivespage (+ 19 211) "2.12 Many-Valued Logic: Classes of Matrices")
;; (find-connectivespage (+ 19 219) "2.13 Algebraic Semantics: Matrices with a Single Designated Value")
;; (find-connectivespage (+ 19 246) "2.14 -Based Algebraic Semantics")
;; (find-connectivespage (+ 19 250) "2.15 A Third Version of Algebraic Semantics: Indiscriminate Validity")
;; (find-connectivespage (+ 19 257) "2.16 From Algebraic Semantics to Equivalent Algebraic Semantics")
;; (find-connectivespage (+ 19 268) "Notes and References for §2.1")
;; (find-connectivespage (+ 19 275) "2.2 MODAL LOGIC")
;; (find-connectivespage (+ 19 275) "2.21 Modal Logic in Fmla: Introduction")
;; (find-connectivespage (+ 19 282) "2.22 Modal Logic in Fmla: Kripke Frames.")
;; (find-connectivespage (+ 19 288) "2.23 Other Logical Frameworks")
;; (find-connectivespage (+ 19 296) "Notes and References for §2.2")
;; (find-connectivespage (+ 19 298) "2.3 THREE RIVALS TO CLASSICAL LOGIC")
;; (find-connectivespage (+ 19 298) "2.31 Quantum Logic")
;; (find-connectivespage (+ 19 302) "2.32 Intuitionistic Logic")
;; (find-connectivespage (+ 19 326) "2.33 Relevant and Linear Logic")
;; (find-connectivespage (+ 19 369) "Notes and References for §2.3")
;; (find-connectivespage (+ 19 375) "3 Connectives: Truth-Functional, Extensional, Congruential")
;; (find-connectivespage (+ 19 375) "3.1 TRUTH-FUNCTIONALITY")
;; (find-connectivespage (+ 19 375) "3.11 Truth-Functional Connectives")
;; (find-connectivespage (+ 19 382) "3.12 Pathologies of Overdetermination")
;; (find-connectivespage (+ 19 385) "3.13 Determinant-induced Conditions on a Consequence Relation")
;; (find-connectivespage (+ 19 403) "3.14 Functional Completeness, Duality, and Dependence")
;; (find-connectivespage (+ 19 418) "3.15 Definability of Connectives")
;; (find-connectivespage (+ 19 423) "3.16 Defining a Connective")
;; (find-connectivespage (+ 19 428) "3.17 Truth-Functions, Rules, and Matrices")
;; (find-connectivespage (+ 19 436) "3.18 Intuitionistically Dangerous Determinants")
;; (find-connectivespage (+ 19 442) "Notes and References for §3.1")
;; (find-connectivespage (+ 19 444) "3.2 EXTENSIONALITY")
;; (find-connectivespage (+ 19 444) "3.21 A Biconditional-based Introduction to Extensionality")
;; (find-connectivespage (+ 19 448) "3.22 A Purified Notion of Extensionality (for GCRs)")
;; (find-connectivespage (+ 19 453) "3.23 Some Extensionality Notions for Consequence Relations")
;; (find-connectivespage (+ 19 461) "3.24 Hybrids and the Subconnective Relation")
;; (find-connectivespage (+ 19 483) "Notes and References for §3.2")
;; (find-connectivespage (+ 19 484) "3.3 CONGRUENTIALITY")
;; (find-connectivespage (+ 19 484) "3.31 Congruential Connectives")
;; (find-connectivespage (+ 19 490) "3.32 Some Related Properties")
;; (find-connectivespage (+ 19 495) "3.33 The Three Properties Compared")
;; (find-connectivespage (+ 19 497) "3.34 Operations vs. Relations")
;; (find-connectivespage (+ 19 508) "Notes and References for §3.3")
;; (find-connectivespage (+ 19 513) "Inversion Principle")
;; (find-connectivestext (+ 19 513) "Inversion Principle")
;; (find-connectivespage (+ 19 1440) "Index")
;; (find-connectivestext "")
;; «hurd» (to ".hurd")
;; http://gigapedia.com/items/107986/nonstandard-analysis---recent-developments--lecture-notes-in-mathematics---vol--983
(code-djvu "hurd0983" "~/books/__logic/hurd__nonstandard_analysis_recent_developments_slnm0983.djvu")
(code-djvutotext "hurd0983" "~/books/__logic/hurd__nonstandard_analysis_recent_developments_slnm0983.djvu")
;; (find-hurd0983page 4 "Contents")
;; (find-hurd0983page (+ 5 120) "Laugwitz")
;; (find-hurd0983text "")
;; «hurd-loeb» (to ".hurd-loeb")
;; http://gigapedia.com/items/107985/victoria-symposium-on-nonstandard-analysis--university-of-victoria-1972
(code-djvu "victoria0369" "~/books/__logic/hurd_loeb__victoria_symposium_on_nonstandard_analysis_SLNM0369.djvu")
(code-djvutotext "victoria0369" "~/books/__logic/hurd_loeb__victoria_symposium_on_nonstandard_analysis_SLNM0369.djvu")
;; (find-victoria0369page 12 "Contents")
;; (find-victoria0369page (+ 17 122) "Kock/Mikkelsen" "Topos-theoretic factorization...)
;; (find-victoria0369page (+ 17 313) "Index")
;; (find-victoria0369text "")
;; http://gigapedia.com/items/194193/an-introduction-to-nonstandard-real-analysis--volume-118--pure-and-applied-mathematics-
(code-djvu "~/books/__logic/hurdloebintro" "hurd_loeb__an_introduction_to_nonstandard_real_analysis.djvu")
(code-djvutotext "~/books/__logic/hurdloebintro" "hurd_loeb__an_introduction_to_nonstandard_real_analysis.djvu")
;; (find-~/books/__logic/hurdloebintropage 7 "Contents")
;; (find-~/books/__logic/hurdloebintropage (+ 12 225) "List of Symbols")
;; (find-~/books/__logic/hurdloebintropage (+ 12 227) "Index")
;; (find-~/books/__logic/hurdloebintrotext "")
;; «hurkens» (to ".hurkens")
;; (find-books "__logic/__logic.el" "hurkens")
;; Antonius Hurkens: A Simplification of Girard's Paradox
;; http://www.cs.cmu.edu/~kw/scans/hurkens95tlca.pdf
;; https://link.springer.com/chapter/10.1007/BFb0014058
;; https://www.reddit.com/r/ProgrammingLanguages/comments/f51dxo/trouble_type_checking_girards_paradox/
(code-pdf-page "hurkens" "~/books/__logic/hurkens__a_simplification_of_girards_paradox.pdf")
(code-pdf-text "hurkens" "~/books/__logic/hurkens__a_simplification_of_girards_paradox.pdf" 1)
;; (find-hurkenspage)
;; (find-hurkenspage 1 "Contents")
;; (find-hurkenspage (+ 1 189) "Index")
;; (find-hurkenstext "")
;; «jamnik» (to ".jamnik")
;; (find-books "__logic/__logic.el" "jamnik")
;; https://www.cl.cam.ac.uk/~mj201/book.html
(code-pdf "jamnikmrd" "~/books/__logic/jamnik__mathematical_reasoning_with_diagrams.pdf")
(code-pdftotext "jamnikmrd" "~/books/__logic/jamnik__mathematical_reasoning_with_diagrams.pdf" 1)
(code-pdf "jamnikdrai" "~/books/__logic/jamnik_ed__diagrammatic_representation_and_inference.pdf")
(code-pdftotext "jamnikdrai" "~/books/__logic/jamnik_ed__diagrammatic_representation_and_inference.pdf" 1)
;; (find-jamnikmrdpage)
;; (find-jamnikmrdtext "")
;; (find-jamnikmrdpage (+ 8 1) "1 Introduction")
;; (find-jamnikmrdpage (+ 8 11) "2 The History of Diagrammatic Systems")
;; (find-jamnikmrdpage (+ 7 27) "3 Diagrammatic Theorems and the Problem Domain")
;; (find-jamnikmrdpage (+ 6 49) "4 The Constructive -Rule and Schematic Proofs")
;; (find-jamnikmrdpage (+ 6 55) "4.4 Finding a Schematic Proof")
;; (find-jamnikmrdtext (+ 6 55) "4.4 Finding a Schematic Proof")
;; (find-jamnikmrdpage (+ 6 55) "Abstract proof(n) from these proofs")
;; (find-jamnikmrdtext (+ 6 55) "Abstract proof(n) from these proofs")
;; (find-jamnikmrdpage (+ 5 71) "5 Designing a Diagrammatic Reasoning System")
;; (find-jamnikmrdpage (+ 5 89) "6 Diagrammatic Operations")
;; (find-jamnikmrdpage (+ 5 103) "7 The Construction of Schematic Proofs")
;; (find-jamnikmrdpage (+ 4 123) "8 The Verification of Schematic Proofs")
;; (find-jamnikmrdpage (+ 3 149) "9 Diamond in Action")
;; (find-jamnikmrdpage (+ 3 163) "10 Complete Automation")
;; (find-jamnikmrdpage (+ 2 175) "Appendix A: More Examples of Diagrammatic Theorems")
;; (find-jamnikmrdpage (+ 2 181) "Appendix B: The -Rule")
;; (find-jamnikmrdpage (+ 2 185) "Glossary")
;; (find-jamnikmrdpage (+ 2 190) "References")
;; (find-jamnikmrdpage (+ 2 199) "Index")
;; (find-jamnikdraipage)
;; (find-jamnikdraipage 8 "Contents")
;; (find-jamnikdraitext 8 "Contents")
;; (find-jamnikdraipage (+ 12 84) "Index")
;; (find-jamnikdraipage (+ 0 310) "Index")
;; (find-jamnikdraitext "")
;; «kamareddine» (to ".kamareddine")
;; (find-books "__logic/__logic.el" "kamareddine")
(code-pdf-page "35yearsofautomaths" "~/books/__logic/kamareddine__thirty_five_years_of_automating_mathematics.pdf")
(code-pdf-text "35yearsofautomaths" "~/books/__logic/kamareddine__thirty_five_years_of_automating_mathematics.pdf" 7)
;; (find-35yearsofautomathspage)
;; (find-35yearsofautomathspage 5 "Contents")
;; (find-35yearsofautomathspage (+ 1 189) "Index")
;; (find-35yearsofautomathstext "")
;; (find-35yearsofautomathspage (+ 7 71) "DE BRUIJN'S AUTOMATH AND PURE TYPE" "SYSTEMS")
;; (find-35yearsofautomathstext (+ 7 71) "DE BRUIJN'S AUTOMATH AND PURE TYPE" "SYSTEMS")
;; (find-35yearsofautomathspage (+ 7 82) "Berardi, 1988j Terlouw,")
;; (find-35yearsofautomathstext (+ 7 82) "Berardi, 1988j Terlouw,")
;; «kelley» (to ".kelley")
;; http://gigapedia.com/items/100530/general-topology--graduate-texts-in-mathematics-
(code-djvu "kelley" "~/books/__logic/kelley__general_topology.djvu")
;; (find-kelleypage 10 "Contents")
;; (find-kelleypage (+ 16 250) "Elementary Set Theory")
;; (find-kelleypage (+ 16 293) "Index")
;; «kleene» (to ".kleene")
;; http://gigapedia.com/items/124942/introduction-to-metamathematics--bibliotheca-mathematica---bibliotheca-mathematica-
(code-djvu "kleeneintrometa" "~/books/__logic/kleene__introduction_to_metamathematics.djvu")
;; (find-kleeneintrometapage 3 "Contents")
;; (find-kleeneintrometapage (+ -265 539) "Index")
;; «knuth» (to ".knuth")
;; http://gigapedia.com/items/105202/surreal-numbers
(code-djvu "surrealnumbers" "~/books/__logic/knuth__surreal_numbers.djvu")
;; (find-surrealnumberspage 3 "Contents")
;; (find-surrealnumberspage (+ 3 6) "In the beginning")
;; «kohlenbach» (to ".kohlenbach")
;; http://gigapedia.org/items/210283/proof-interpretations
(code-xpdf "kohlenbach" "~/books/__logic/kohlenbach__proof_interpretations.pdf")
;; (find-kohlenbachpage 9 "Contents")
;; (find-kohlenbachpage (+ 10 50) "6. Negative Translation")
;; «kripke» (to ".kripke")
;; (find-books "__logic/__logic.el" "kripke")
(code-pdf "kripkenan" "~/books/__logic/kripke__naming_and_necessity.pdf")
(code-pdftotext "kripkenan" "~/books/__logic/kripke__naming_and_necessity.pdf" 1)
;; (find-kripkenanpage)
;; (find-kripkenanpage 1 "Contents")
;; (find-kripkenanpage (+ 1 189) "Index")
;; (find-kripkenantext "")
;; «krivine» (to ".krivine")
(code-djvu "kreiselkrivine" "~/books/__logic/kreisel_krivine__elements_of_mathematical_logic__model_theory.djvu")
(code-djvu "krivinetae" "~/books/__logic/krivine__theorie_axiomatique_des_ensembles.djvu")
(code-xpdf "krivinete" "~/books/__logic/krivine__theorie_des_ensembles.pdf")
(code-pdftotext "krivinete" "~/books/__logic/krivine__theorie_des_ensembles.pdf")
;; (find-kreiselkrivinepage 1 "Contents")
;; (find-kreiselkrivinepage (+ 1 1) "Index")
;; (find-krivinetaepage (+ -2 9) "1. Axiomes de la Theorie des Ensembles")
;; (find-krivinetaepage 118 "Table des Matieres")
;; (find-krivinetepage (+ 8 7) "1. Axiomes de Zermelo-Fraenkel")
;; (find-krivinetepage (+ 8 265) "Index")
;; (find-krivinetepage (+ 8 271) "Table des Matieres")
;; (find-krivinetetext)
;; «kubota» (to ".kubota")
;; (find-books "__logic/__logic.el" "kubota")
;; https://owlofminerva.net/kubota/
;; https://owlofminerva.net/foundations-of-mathematics/
;; https://www.owlofminerva.net/files/fom.pdf#page=10
;; file:///home/edrx/snarf/https/www.owlofminerva.net/files/fom.pdf
;; file:///home/edrx/snarf/https/www.owlofminerva.net/files/fom.pdf#page=10
(code-pdf-page "kubotafom" "$S/https/www.owlofminerva.net/files/fom.pdf")
(code-pdf-text "kubotafom" "$S/https/www.owlofminerva.net/files/fom.pdf")
;; (find-kubotafompage)
;; (find-kubotafomtext)
;; «kunen» (to ".kunen")
;; http://gigapedia.com/items/209494/set-theory--studies-in-logic-and-the-foundations-of-mathematics---studies-in-logic-and-the-foundations-of-mathematics-
(code-djvu "kunen" "~/books/__logic/kunen__set_theory.djvu")
;; (find-kunenpage 6 "Contents")
;; (find-kunenpage (+ 14 311) "Index")
;; «lacompling2018» (to ".lacompling2018")
;; (find-books "__logic/__logic.el" "lacompling2018")
;; "Logic and Algorithms in Computational Linguistics 2018 (LACompLing2018)"
;; https://link.springer.com/chapter/10.1007/978-3-030-30077-7_1
(code-pdf-page "lacompling2018" "~/books/__logic/lacompling2018.pdf")
(code-pdf-text "lacompling2018" "~/books/__logic/lacompling2018.pdf" 1)
;; (find-lacompling2018page)
;; (find-lacompling2018page 10 "Contents")
;; (find-lacompling2018page (+ 1 189) "Index")
;; (find-lacompling2018text "")
;; «landau» (to ".landau")
;; (find-angg ".emacs.papers" "automath")
;; http://gigapedia.com/items/46452/foundations-of-analysis---the-arithmetic-of-whole--rational--irrational--and-complex-numbers--a-supplement-to-textbooks-on-the-differential-and-integral-calculus
(code-djvu "landaufoa" "~/books/__logic/landau__foundations_of_analysis.djvu")
;; (find-landaufoapage 12 "Contents")
;; (find-landaufoapage (+ 13 135) "Index")
;; «leary» (to ".leary")
;; (find-books "__logic/__logic.el" "leary")
;; https://minerva.geneseo.edu/a-friendly-introduction-to-mathematical-logic/
;; https://knightscholar.geneseo.edu/geneseo-authors/6/
(code-pdf "learykfriendly" "~/books/__logic/leary_kristiansen__a_friendly_introduction_to_mathematical_logic.pdf")
(code-pdftotext "learykfriendly" "~/books/__logic/leary_kristiansen__a_friendly_introduction_to_mathematical_logic.pdf" 16)
;; (find-learykfriendlypage)
;; (find-learykfriendlypage 6 "Contents")
;; (find-learykfriendlypage (+ 16 33) "1.8 Substitutions and Substitutability")
;; (find-learykfriendlytext (+ 16 33) "1.8 Substitutions and Substitutability")
;; (find-learykfriendlytext "")
;; «lecomte» (to ".lecomte")
;; (find-books "__logic/__logic.el" "lecomte")
(code-pdf-page "lecomtemll" "~/books/__logic/lecomte__meaning_logic_and_ludics.pdf")
(code-pdf-text "lecomtemll" "~/books/__logic/lecomte__meaning_logic_and_ludics.pdf" 1)
;; (find-lecomtemllpage)
;; (find-lecomtemllpage 13 "Contents")
;; (find-lecomtemllpage (+ 20 291) "12. Interaction and dialogue")
;; (find-lecomtemllpage (+ 20 306) "12.2. Ludics")
;; (find-lecomtemllpage (+ 20 330) "12.3.2. What logic for ludics?")
;; (find-lecomtemlltext "")
;; «leeds1990» (to ".leeds1990")
;; (find-books "__logic/__logic.el" "leeds1990")
(code-pdf-page "leeds1990" "~/books/__logic/aczel_simmons_wainer__proof_theory_a_selection_of_papers_from_the_leeds_proof_theory_programme_1990.pdf")
(code-pdf-text "leeds1990" "~/books/__logic/aczel_simmons_wainer__proof_theory_a_selection_of_papers_from_the_leeds_proof_theory_programme_1990.pdf" 10)
;; (find-leeds1990page)
;; (find-leeds1990page 5 "Contents")
;; (find-leeds1990page (+ 10 3) "Basic Proof Theory")
;; (find-leeds1990page (+ 10 27) "A short course in ordinal analysis")
;; (find-leeds1990text "")
;; «leroy» (to ".leroy")
;; (find-books "__logic/__logic.el" "leroy")
;; Polymorphic typing of an algorithmic language
;; https://xavierleroy.org/publi/phd-thesis.pdf
;; «lifschitz» (to ".lifschitz")
;; (find-books "__logic/__logic.el" "lifschitz")
;; https://cs.nyu.edu/pipermail/fom/2021-March/022524.html
(code-pdf-page "lifschitz" "~/books/__logic/lifschitz__on_calculational_proofs.pdf")
(code-pdf-text "lifschitz" "~/books/__logic/lifschitz__on_calculational_proofs.pdf" 1)
;; (find-lifschitzpage)
;; (find-lifschitzpage 1 "Contents")
;; (find-lifschitzpage (+ 1 189) "Index")
;; (find-lifschitztext "")
;; «lukasiewicz» (to ".lukasiewicz")
;; (find-books "__logic/__logic.el" "lukasiewicz")
(code-pdf-page "lukasmfl" "~/books/__logic/lukasiewicz__aristotle_s_syllogistic_from_the_standpoint_of_modern_formal_logic.pdf")
(code-pdf-text "lukasmfl" "~/books/__logic/lukasiewicz__aristotle_s_syllogistic_from_the_standpoint_of_modern_formal_logic.pdf" 1)
;; (find-lukasmflpage)
;; (find-lukasmflpage 11 "Contents")
;; (find-lukasmfltext 11 "Contents")
;; (find-lukasmflpage (+ 14 1) "Index")
;; (find-lukasmflpage (+ 14 209) "Index")
;; (find-lukasmfltext "")
;; «luo» (to ".luo")
;; https://www.cs.rhul.ac.uk/home/zhaohui/publications.html
;; https://www.cs.rhul.ac.uk/home/zhaohui/books.html
;;
;; Version converted from the .ps:
;; https://www.cs.rhul.ac.uk/home/zhaohui/THESIS90.ps
;; (find-fline "$S/https/www.cs.rhul.ac.uk/home/zhaohui/")
;; (find-sh "cd $S/https/www.cs.rhul.ac.uk/home/zhaohui/ && ps2pdf THESIS90.ps")
(code-pdf-page "luothesis" "$S/https/www.cs.rhul.ac.uk/home/zhaohui/THESIS90.pdf")
(code-pdf-text "luothesis" "$S/https/www.cs.rhul.ac.uk/home/zhaohui/THESIS90.pdf" 6)
;; (find-luothesispage)
;; (find-luothesistext)
;; (find-luothesispage 5 "Contents")
;; (find-luothesistext 5 "Contents")
;; (find-luothesispage (+ 6 1) "1 Introduction")
;; (find-luothesispage (+ 6 1) "1.1 Type Theories and Computer Science")
;; (find-luothesispage (+ 6 1) "1.1.1 Type theories as logical systems")
;; (find-luothesispage (+ 6 5) "1.1.2 Applications in computer science")
;; (find-luothesispage (+ 6 9) "1.2 Motivations and Overview of the Thesis")
;; (find-luothesispage (+ 6 12) "1.3 Related Work")
;; (find-luothesispage (+ 6 14) "2 ECC: an Extended Calculus of Constructions")
;; (find-luothesispage (+ 6 14) "2.1 A Formal Presentation of ECC")
;; (find-luothesispage (+ 6 14) "2.1.1 The term calculus")
;; (find-luothesispage (+ 6 16) "2.1.2 Judgements and inference rules")
;; (find-luothesispage (+ 6 16) "The inference rules of ECC ")
;; (find-luothesistext (+ 6 16) "The inference rules of ECC ")
;; (find-luothesispage (+ 6 18) "2.2 Informal Explanations")
;; (find-luothesispage (+ 6 18) "2.2.1 Judgements and validity of contexts")
;; (find-luothesispage (+ 6 19) "2.2.2 Propositions and the impredicative universe Prop")
;; (find-luothesispage (+ 6 19) "2.2.3 Non-propositional types and predicative universes Typej")
;; (find-luothesispage (+ 6 22) "2.2.4 Lifting of propositions and -types as subsets")
;; (find-luothesispage (+ 6 23) "2.2.5 Conversion and full cumulativity")
;; (find-luothesispage (+ 6 26) "3 Basic Meta-theoretic Properties")
;; (find-luothesispage (+ 6 26) "3.1 Properties of the Term Calculus")
;; (find-luothesispage (+ 6 31) "3.2 Derivable Judgements and Derivability")
;; (find-luothesispage (+ 6 40) "3.3 Principal Types")
;; (find-luothesispage (+ 6 43) "4 Quasi Normalization")
;; (find-luothesispage (+ 6 45) "4.1 Environment")
;; (find-luothesispage (+ 6 46) "4.2 Levels of Types")
;; (find-luothesispage (+ 6 48) "4.3 The Quasi Normalization Theorem")
;; (find-luothesispage (+ 6 49) "4.3.1 ECCn")
;; (find-luothesispage (+ 6 50) "4.3.2 An inductive proof of quasi normalization")
;; (find-luothesispage (+ 6 58) "4.3.3 Quasi normalization. a summary")
;; (find-luothesispage (+ 6 59) "4.4 A Complexity Measure of Types")
;; (find-luothesispage (+ 6 61) "5 Strong Normalization")
;; (find-luothesispage (+ 6 61) "5.1 Girard-Tait's Reducibility Method")
;; (find-luothesispage (+ 6 62) "5.1.1 Saturated sets and candidates of reducibility")
;; (find-luothesispage (+ 6 65) "5.1.2 Separability of types v.s. type-valued functions")
;; (find-luothesispage (+ 6 66) "5.2 The Strong Normalization Theorem")
;; (find-luothesispage (+ 6 66) "5.2.1 Possible values of terms")
;; (find-luothesispage (+ 6 68) "5.2.2 Assignments and valuations")
;; (find-luothesispage (+ 6 69) "5.2.3 Interpretation of terms")
;; (find-luothesispage (+ 6 73) "5.2.4 Soundness of the interpretation")
;; (find-luothesispage (+ 6 77) "5.2.5 The strong normalization theorem")
;; (find-luothesispage (+ 6 79) "6 Logical Consistency and Decidability")
;; (find-luothesispage (+ 6 79) "6.1 The Embedded Higher-order Logic")
;; (find-luothesispage (+ 6 79) "6.1.1 The embedded logic")
;; (find-luothesispage (+ 6 82) "De nition 6.1.4 (Leibniz's equality)")
;; (find-luothesistext (+ 6 82) "De nition 6.1.4 (Leibniz's equality)")
;; (find-luothesispage (+ 6 82) "6.1.2 Logical consistency")
;; (find-luothesispage (+ 6 83) "6.1.3 A conservativity conjecture")
;; (find-luothesispage (+ 6 85) "6.2 Decidability")
;; (find-luothesispage (+ 6 86) "6.2.1 Decidability of conversion and cumulativity")
;; (find-luothesispage (+ 6 86) "6.2.2 Decidability of type inference and type checking")
;; (find-luothesispage (+ 6 89) "7 A Set-theoretic Interpretation")
;; (find-luothesispage (+ 6 90) "7.1 Understanding the Calculus in the ! Set Framework")
;; (find-luothesispage (+ 6 92) "7.2 Interpretation of Valid Contexts")
;; (find-luothesispage (+ 6 93) "7.3 Interpretation of Universes Typej and /-types")
;; (find-luothesispage (+ 6 95) "7.4 Interpretation of Universe Prop and Propositions")
;; (find-luothesispage (+ 6 97) "7.5 Discussions")
;; (find-luothesispage (+ 6 99) "8 Theory Abstraction in Proof Development")
;; (find-luothesispage (+ 6 99) "8.1 A Notion of Theory")
;; (find-luothesispage (+ 6 102) "8.2 Abstract Reasoning")
;; (find-luothesispage (+ 6 102) "8.3 Structured Reasoning")
;; (find-luothesispage (+ 6 103) "8.3.1 Proof inheritance")
;; (find-luothesispage (+ 6 103) "8.3.2 Sharing by parameterization")
;; (find-luothesispage (+ 6 105) "8.4 Discussions")
;; (find-luothesispage (+ 6 108) "9 Some Issues in Program Speci cation and Programming")
;; (find-luothesispage (+ 6 109) "9.1 Program Speci cation and Equality Re ection")
;; (find-luothesispage (+ 6 110) "Theorem 9.1.1 (equality re ection)")
;; (find-luothesistext (+ 6 110) "Theorem 9.1.1 (equality re ection)")
;; (find-luothesispage (+ 6 111) "9.2 Programming at Predicative Levels")
;; (find-luothesispage (+ 6 112) "9.2.1 Embedding strati ed polymorphism in ECC")
;; (find-luothesispage (+ 6 114) "9.2.2 Existential types and discussion")
;; (find-luothesispage (+ 6 116) "10 Conclusions and Further Research")
;; (find-luothesispage (+ 6 118) "Bibliography")
;; (find-luothesispage (+ 6 127) "Notation and Symbols")
;; (find-luothesispage (+ 6 130) "Index")
;; Scanned version, without OCRization:
;; https://www.cs.rhul.ac.uk/home/zhaohui/ECS-LFCS-90-118.pdf
(code-pdf-page "luothesiss" "$S/https/www.cs.rhul.ac.uk/home/zhaohui/ECS-LFCS-90-118.pdf")
(code-pdf-text "luothesiss" "$S/https/www.cs.rhul.ac.uk/home/zhaohui/ECS-LFCS-90-118.pdf")
;; (find-luothesisspage)
;; (find-luothesisspage 8 "Contents")
;; (find-luothesisspage (+ 10 21) "2. ECC: an extended Calculus of Constructions")
;; (find-luothesisstext)
(code-pdf-page "luocr" "~/books/__logic/luo__computation_and_reasoning_a_type_theory_for_computer_science.pdf")
(code-pdf-text "luocr" "~/books/__logic/luo__computation_and_reasoning_a_type_theory_for_computer_science.pdf" 12)
;; (find-luocrpage)
;; (find-luocrpage 9 "Contents")
;; (find-luocrpage (+ 12 41) "2.3.2. Sigma-types and existential types")
;; (find-luocrpage (+ 12 74) "4.2.1. Levels of types")
;; (find-luocrtext "")
;; «luo-callaghan» (to ".luo-callaghan")
;; (find-books "__logic/__logic.el" "luo-callaghan")
;; https://link.springer.com/chapter/10.1007/3-540-44557-9_6
(code-pdf-page "lcplastic" "~/books/__logic/callaghan_luo__implementation_techniques_for_inductive_types_in_plastic.pdf")
(code-pdf-text "lcplastic" "~/books/__logic/callaghan_luo__implementation_techniques_for_inductive_types_in_plastic.pdf" 1)
;; (find-lcplasticpage)
;; (find-lcplasticpage 1 "Contents")
;; (find-lcplasticpage (+ 1 189) "Index")
;; (find-lcplastictext "")
;; «luo-proofirr» (to ".luo-proofirr")
;; (find-books "__logic/__logic.el" "luo-proofirr")
;; (find-books "__logic/__logic.el" "lacompling2018")
(code-pdf-page "lacompling2018" "~/books/__logic/lacompling2018.pdf")
(code-pdf-text "lacompling2018" "~/books/__logic/lacompling2018.pdf" 10)
;; (find-lacompling2018page)
;; (find-lacompling2018page 10 "Contents")
;; (find-lacompling2018page (+ 10 1) "Proof Irrelevance in Type-Theoretical" "Semantics")
;; (find-lacompling2018text (+ 10 1) "Proof Irrelevance in Type-Theoretical" "Semantics")
;; (find-lacompling2018page (+ 10 7) "2.3 Proof Irrelevance in Impredicative Type Theories")
;; (find-lacompling2018text (+ 10 7) "2.3 Proof Irrelevance in Impredicative Type Theories")
;; (find-lacompling2018text "")
;; «luxemburg-robinson» (to ".luxemburg-robinson")
;; http://gigapedia.com/items/374065/contributions-to-non-standard-analysis--studies-in-logic-and-the-foundations-of-mathematics-69-
(code-xpdf "luxemburgrobcontrnsa" "~/books/__logic/luxemburg_robinson__contributions_to_nonstandard_analysis.pdf")
(code-pdftotext "luxemburgrobcontrnsa" "~/books/__logic/luxemburg_robinson__contributions_to_nonstandard_analysis.pdf")
;; (find-luxemburgrobcontrnsapage 1 "Contents")
;; (find-luxemburgrobcontrnsapage (+ 4 1) "Robinson")
;; (find-luxemburgrobcontrnsapage (+ -4 281) "Jensen")
;; (find-luxemburgrobcontrnsatext "")
;; «machover» (to ".machover")
;; http://gigapedia.com/items/251013/set-theory--logic-and-their-limitations
(code-djvu "macoverstll" "~/books/__logic/machover__set_theory_logic_and_their_limitations.djvu")
;; (find-macoverstllpage 9 "Contents")
;; (find-macoverstllpage (+ 14 1) "0. Mathematical induction")
;; (find-macoverstllpage (+ 14 9) "1. Sets and classes")
;; (find-macoverstllpage (+ 14 284) "General index")
;; «machover-hirschfeld» (to ".machover-hirschfeld")
(code-djvu "machoverhischfeld" "~/books/__logic/machover_hirschfeld__lectures_on_non-standard_analysis.djvu")
(code-pdftotext "machoverhischfeld" "~/books/__logic/machover_hirschfeld__lectures_on_non-standard_analysis.djvu")
;; (find-machoverhischfeldpage 5 "Contents")
;; (find-machoverhischfeldpage (+ 6 17) "Index")
;; (find-machoverhischfeldtext "")
;; «maddy» (to ".maddy")
;; https://www.cs.umd.edu/~gasarch/BLOGPAPERS/belaxioms1.pdf
;; (find-fline "$S/https/www.cs.umd.edu/~gasarch/BLOGPAPERS/")
(code-pdf-page "believing1" "$S/https/www.cs.umd.edu/~gasarch/BLOGPAPERS/belaxioms1.pdf")
(code-pdf-text "believing1" "$S/https/www.cs.umd.edu/~gasarch/BLOGPAPERS/belaxioms1.pdf")
;; (find-believing1page)
;; (find-believing1text)
;; «marcos» (to ".marcos")
;; (find-books "__logic/__logic.el" "marcos")
;; https://sites.google.com/site/sequiturquodlibet/courses/lc-dgm
(code-pdf "marcoslc1" "~/books/__logic/marcos__logica_computacional__cap1.pdf")
(code-pdftotext "marcoslc1" "~/books/__logic/marcos__logica_computacional__cap1.pdf" 1)
(code-pdf "marcoslc2" "~/books/__logic/marcos__logica_computacional__cap2.pdf")
(code-pdftotext "marcoslc2" "~/books/__logic/marcos__logica_computacional__cap2.pdf" 1)
(code-pdf "marcoslc31" "~/books/__logic/marcos__logica_computacional__cap3_v1.pdf")
(code-pdftotext "marcoslc31" "~/books/__logic/marcos__logica_computacional__cap3_v1.pdf" 1)
(code-pdf "marcoslc32" "~/books/__logic/marcos__logica_computacional__cap3_v2.pdf")
(code-pdftotext "marcoslc32" "~/books/__logic/marcos__logica_computacional__cap3_v2.pdf" 1)
(code-pdf "marcoslc4" "~/books/__logic/marcos__logica_computacional__cap4.pdf")
(code-pdftotext "marcoslc4" "~/books/__logic/marcos__logica_computacional__cap4.pdf" 1)
;; (find-marcoslc1page)
;; (find-marcoslc1page "Lógica proposicional")
;; (find-marcoslc1text "")
;; (find-marcoslc2page)
;; (find-marcoslc2page 1 "Conteúdo")
;; (find-marcoslc2page 3 "Lóogica proposicional em Isabelle")
;; (find-marcoslc2page (+ 1 189) "Index")
;; (find-marcoslc2text "")
;; (find-marcoslc31page)
;; (find-marcoslc31page 1 "Lógica de primeira ordem")
;; (find-marcoslc31text "")
;; (find-marcoslc32page)
;; (find-marcoslc32page 1 "Lógica de primeira ordem")
;; (find-marcoslc32text "")
;; (find-marcoslc4page)
;; (find-marcoslc4page 1 "Lógica Modal")
;; (find-marcoslc4text "")
(code-pdf-page "marcoswialt" "~/books/__logic/blasio_caleiro_marcos__what_is_a_logical_theory_on_theories_containing_assertions_and_denials.pdf")
(code-pdf-text "marcoswialt" "~/books/__logic/blasio_caleiro_marcos__what_is_a_logical_theory_on_theories_containing_assertions_and_denials.pdf" 1)
;; (find-marcoswialtpage)
;; (find-marcoswialtpage 1 "Contents")
;; (find-marcoswialtpage (+ 1 189) "Index")
;; (find-marcoswialttext "")
;; «martin-lof» (to ".martin-lof")
;; (find-books "__logic/__logic.el" "martin-lof")
;; (find-LATEX "catsem-ab.bib" "bib-MartinLof84")
;; https://github.com/michaelt/martin-lof
;; https://archive-pml.github.io/martin-lof/pdfs/
;; https://archive-pml.github.io/martin-lof/pdfs/Bibliopolis-Book-retypeset-1984.pdf
;; Per Martin-Lof: "Intuitionistic Type Theory"
(code-pdf-page "martinlofitt" "$S/https/archive-pml.github.io/martin-lof/pdfs/Bibliopolis-Book-retypeset-1984.pdf")
(code-pdf-text "martinlofitt" "$S/https/archive-pml.github.io/martin-lof/pdfs/Bibliopolis-Book-retypeset-1984.pdf" 6)
;; (find-martinlofittpage)
;; (find-martinlofitttext)
;; (find-martinlofittpage 3 "Contents")
;; (find-martinlofitttext 3 "Contents")
;; (find-martinlofittpage (+ 6 1) "Introductory remarks")
;; (find-martinlofitttext (+ 6 1) "Introductory remarks")
;; (find-martinlofittpage (+ 6 2) "Propositions and judgements")
;; (find-martinlofitttext (+ 6 3) "A, B prop")
;; (find-martinlofittpage (+ 6 4) "Explanations of the forms of judgement")
;; (find-martinlofittpage (+ 6 6) "Propositions")
;; (find-martinlofittpage (+ 6 8) "Rules of equality")
;; (find-martinlofittpage (+ 6 9) "Hypothetical judgements and substitution rules")
;; (find-martinlofittpage (+ 6 10) "b(a) = b(c)")
;; (find-martinlofitttext (+ 6 10) "b(a) = b(c)")
;; (find-martinlofittpage (+ 6 10) "Judgements with more than one assumption and contexts")
;; (find-martinlofittpage (+ 6 11) "Sets and categories")
;; (find-martinlofittpage (+ 6 13) "General remarks on the rules")
;; (find-martinlofittpage (+ 6 13) "Cartesian product of a family of sets")
;; (find-martinlofittpage (+ 6 16) "Definitional equality")
;; (find-martinlofittpage (+ 6 16) "Applications of the cartesian product")
;; (find-martinlofittpage (+ 6 20) "Disjoint union of a family of sets")
;; (find-martinlofittpage (+ 6 22) "Applications of the disjoint union")
;; (find-martinlofittpage (+ 6 27) "The axiom of choice")
;; (find-martinlofittpage (+ 6 28) "The notion of such that")
;; (find-martinlofittpage (+ 6 29) "Disjoint union of two sets")
;; (find-martinlofittpage (+ 6 31) "Propositional equality")
;; (find-martinlofittpage (+ 6 35) "Finite sets")
;; (find-martinlofittpage (+ 6 37) "Consistency")
;; (find-martinlofittpage (+ 6 38) "Natural numbers")
;; (find-martinlofittpage (+ 6 42) "Lists")
;; (find-martinlofittpage (+ 6 43) "Wellorderings")
;; (find-martinlofittpage (+ 6 47) "Universes")
;; «martin-lof-cmcp» (to ".martin-lof-cmcp")
;; (find-books "__logic/__logic.el" "martin-lof-cmcp")
;; https://raw.githubusercontent.com/michaelt/martin-lof/master/pdfs/Constructive-mathematics-and-computer-programming-1982.pdf
(code-pdf-page "martinlofcmcp" "$S/https/raw.githubusercontent.com/michaelt/martin-lof/master/pdfs/Constructive-mathematics-and-computer-programming-1982.pdf")
(code-pdf-text "martinlofcmcp" "$S/https/raw.githubusercontent.com/michaelt/martin-lof/master/pdfs/Constructive-mathematics-and-computer-programming-1982.pdf" 166)
;; (find-martinlofcmcppage)
;; (find-martinlofcmcppage (+ -166 167))
;; (find-martinlofcmcppage (+ -166 172) "(underbraces)")
;; (find-martinlofcmcppage (+ -166 184) "of having but total elements")
;; (find-martinlofcmcptext)
;; «martin-lof-as» (to ".martin-lof-as")
;; https://archive-pml.github.io/martin-lof/pdfs/Martin-Lof-Analytic-and-Synthetic-Judgements-in-Type-Theory.pdf
(code-pdf-page "martinlofas" "$S/https/archive-pml.github.io/martin-lof/pdfs/Martin-Lof-Analytic-and-Synthetic-Judgements-in-Type-Theory.pdf")
(code-pdf-text "martinlofas" "$S/https/archive-pml.github.io/martin-lof/pdfs/Martin-Lof-Analytic-and-Synthetic-Judgements-in-Type-Theory.pdf")
;; (find-martinlofaspage)
;; (find-martinlofastext)
;; «martin-lof-mean» (to ".martin-lof-mean")
;; https://archive-pml.github.io/martin-lof/pdfs/Meanings-of-the-Logical-Constants-1983.pdf
;; (find-fline "$S/https/archive-pml.github.io/martin-lof/pdfs/")
(code-pdf-page "martinlofmean" "$S/https/archive-pml.github.io/martin-lof/pdfs/Meanings-of-the-Logical-Constants-1983.pdf")
(code-pdf-text "martinlofmean" "$S/https/archive-pml.github.io/martin-lof/pdfs/Meanings-of-the-Logical-Constants-1983.pdf")
;; (find-martinlofmeanpage)
;; (find-martinlofmeantext)
;; (find-martinlofmeanpage 1 "Siena")
;; (find-martinlofmeantext 1 "Siena")
;; (find-martinlofmeanpage 1 "Kant")
;; (find-martinlofmeantext 1 "Kant")
;; «martin-lof-atot» (to ".martin-lof-atot")
;; https://raw.githubusercontent.com/michaelt/martin-lof/master/pdfs/martin-loef1971%20-%20A%20Theory%20of%20Types.pdf
(code-pdf-page "martinlofatot" "$S/https/raw.githubusercontent.com/michaelt/martin-lof/master/pdfs/martin-loef1971%20-%20A%20Theory%20of%20Types.pdf")
(code-pdf-text "martinlofatot" "$S/https/raw.githubusercontent.com/michaelt/martin-lof/master/pdfs/martin-loef1971%20-%20A%20Theory%20of%20Types.pdf")
;; (find-martinlofatotpage)
;; (find-martinlofatottext)
;; (find-martinlofatotpage (+ 2 24) "Existence and disjoint union")
;; (find-martinlofatottext (+ 2 24) "Existence and disjoint union")
;; «martin-lof-ittpp» (to ".martin-lof-ittpp")
;; https://archive-pml.github.io/martin-lof/pdfs/An-Intuitionistic-Theory-of-Types-Predicative-Part-1975.pdf
(code-pdf-page "martinlofittpp" "$S/https/archive-pml.github.io/martin-lof/pdfs/An-Intuitionistic-Theory-of-Types-Predicative-Part-1975.pdf")
(code-pdf-text "martinlofittpp" "$S/https/archive-pml.github.io/martin-lof/pdfs/An-Intuitionistic-Theory-of-Types-Predicative-Part-1975.pdf")
;; (find-martinlofittpppage)
;; (find-martinlofittpptext)
;; «martin-lof-transcriptions» (to ".martin-lof-transcriptions")
;; https://mail.google.com/mail/u/0/#inbox/FMfcgzGqQSJGJHjCslhlgcNsKLtKGSfh
;; https://pml.flu.cas.cz/
;; https://pml.flu.cas.cz/uploads/PML-LeidenLectures93.pdf
;; https://github.com/jozefg/learn-tt/issues/14
;; "Philosophical Aspects of Intuitionistic Type Theory"
(code-pdf-page "pmlll93" "$S/https/pml.flu.cas.cz/uploads/PML-LeidenLectures93.pdf")
(code-pdf-text "pmlll93" "$S/https/pml.flu.cas.cz/uploads/PML-LeidenLectures93.pdf")
;; (find-pmlll93page)
;; (find-pmlll93text)
;; How did 'judgement' come to be a term of logic?
;; https://pml.flu.cas.cz/uploads/PML-Paris14Oct11.pdf
;; https://savoirs.ens.fr//expose.php?id=481
;; The two interpretations of natural deduction: how do they fit together?
;; https://pml.flu.cas.cz/uploads/PML-Tubingen28Nov15.pdf
;; https://github.com/michaelt/martin-lof The collected works of Per Martin-Löf
;; https://github.com/jozefg/learn-tt ***
(code-pdf "martinlofdurante" "~/books/__logic/martin-lof_durante__on_the_meanings_of_the_logical_constants.pdf")
(code-pdftotext "martinlofdurante" "~/books/__logic/martin-lof_durante__on_the_meanings_of_the_logical_constants.pdf" 1)
;; (find-martinlofdurantepage)
;; (find-martinlofdurantepage 1 "Contents")
;; (find-martinlofdurantepage (+ 1 189) "Index")
;; (find-martinlofdurantetext "")
;; «meleiro» (to ".meleiro")
;; (find-books "__logic/__logic.el" "meleiro")
(code-pdf-page "meleiroebl2019" "~/books/__logic/ebl2019_juan_meleiro_slides.pdf")
(code-pdf-text "meleiroebl2019" "~/books/__logic/ebl2019_juan_meleiro_slides.pdf" 1)
;; (find-meleiroebl2019page)
;; (find-meleiroebl2019page 1 "Contents")
;; (find-meleiroebl2019page (+ 1 189) "Index")
;; (find-meleiroebl2019text "")
;; «mendelson» (to ".mendelson")
;; (find-books "__logic/__logic.el" "mendelson")
;; Mendelson: "A Semantic Proof of the Eliminability of Descriptions" (1960)
;; doi:10.1002/malq.19600060708
(code-pdf-page "mendelsoneod" "~/books/__logic/mendelson__a_semantic_proof_of_the_eliminability_of_descriptions.pdf")
(code-pdf-text "mendelsoneod" "~/books/__logic/mendelson__a_semantic_proof_of_the_eliminability_of_descriptions.pdf" 1)
;; (find-mendelsoneodpage)
;; (find-mendelsoneodpage 1 "Contents")
;; (find-mendelsoneodpage (+ 1 189) "Index")
;; (find-mendelsoneodtext "")
;; «mints» (to ".mints")
;; http://gigapedia.com/items/54694/a-short-introduction-to-intuitionistic-logic--university-series-in-mathematics---university-series-in-mathematics-
(code-xpdf "mintssiil" "~/books/__logic/mints__a_short_introduction_to_intuitionistic_logic.pdf")
(code-pdftotext "mintssiil" "~/books/__logic/mints__a_short_introduction_to_intuitionistic_logic.pdf")
;; (find-mintssiilpage 6 "Contents")
;; (find-mintssiilpage (+ 8 1) "Introduction")
;; (find-mintssiilpage (+ -2 129) "Index")
;; (find-mintssiiltext)
;; «monin-ene-perin» (to ".monin-ene-perin")
;; (find-books "__logic/__logic.el" "monin-ene-perin")
;; Monin/Ene/Perin: "Gentzen-Prawitz Natural Deduction as a Teaching Tool"
;; https://arxiv.org/abs/0907.3599
;; https://arxiv.org/pdf/0907.3599.pdf
(code-pdf-page "gpndtt" "$S/https/arxiv.org/pdf/0907.3599.pdf")
(code-pdf-text "gpndtt" "$S/https/arxiv.org/pdf/0907.3599.pdf")
;; (find-gpndttpage)
;; (find-gpndtttext)
;; «moraes-queiroz» (to ".moraes-queiroz")
;; (find-books "__logic/__logic.el" "moraes-queiroz")
;; https://www.researchgate.net/publication/277070621_Grafos_existenciais_de_C_S_Peirce_uma_introducao_ao_sistema_alfa
(code-pdf-page "sistemaalfa" "~/books/__logic/moraes_queiroz__grafos_existenciais_de_c_s_peirce.pdf")
(code-pdf-text "sistemaalfa" "~/books/__logic/moraes_queiroz__grafos_existenciais_de_c_s_peirce.pdf" 1)
;; (find-sistemaalfapage)
;; (find-sistemaalfapage 1 "Contents")
;; (find-sistemaalfapage (+ 1 189) "Index")
;; (find-sistemaalfatext "")
;; «mortari» (to ".mortari")
(code-djvu "mortari" "~/books/__logic/mortari__introducao_a_logica.djvu")
(code-djvutotext "mortari" "~/books/__logic/mortari__introducao_a_logica.djvu" 1)
;; (find-mortaripage)
;; (find-mortaripage 1 "Contents")
;; (find-mortaripage (+ 1 189) "Index")
;; (find-mortaritext "")
;; «mortensen» (to ".mortensen")
(code-pdf "mortensen" "~/books/__logic/mortensen__inconsistent_mathematics.pdf")
(code-pdftotext "mortensen" "~/books/__logic/mortensen__inconsistent_mathematics.pdf" 10)
;; (find-mortensenpage)
;; (find-mortensenpage 7 "Contents")
;; (find-mortensenpage (+ 10 152) "Index")
;; (find-mortensentext "")
;; (find-mortensenpage (+ 10 1) "ONE MOTIVATIONS")
;; (find-mortensentext (+ 10 1) "ONE MOTIVATIONS")
;; (find-mortensenpage (+ 10 1) " 1. Paraconsistency")
;; (find-mortensentext (+ 10 1) " 1. Paraconsistency")
;; (find-mortensenpage (+ 10 5) " 2. Summary")
;; (find-mortensentext (+ 10 5) " 2. Summary")
;; (find-mortensenpage (+ 10 7) " 3. Philosophical Implications")
;; (find-mortensentext (+ 10 7) " 3. Philosophical Implications")
;; (find-mortensenpage (+ 10 15) "TWO ARITHMETIC")
;; (find-mortensentext (+ 10 15) "TWO ARITHMETIC")
;; (find-mortensenpage (+ 10 15) " 1. Relevant Arithmetic")
;; (find-mortensentext (+ 10 15) " 1. Relevant Arithmetic")
;; (find-mortensenpage (+ 10 20) " 2. Nonclassical Logics and their Theories")
;; (find-mortensentext (+ 10 20) " 2. Nonclassical Logics and their Theories")
;; (find-mortensenpage (+ 10 27) " 3. Models for Number Systems with Arithmetical Operations")
;; (find-mortensentext (+ 10 27) " 3. Models for Number Systems with Arithmetical Operations")
;; (find-mortensenpage (+ 10 31) " 4. Summary of Further Results in Arithmetic")
;; (find-mortensentext (+ 10 31) " 4. Summary of Further Results in Arithmetic")
;; (find-mortensenpage (+ 10 33) "THREE MODULO INFINITY")
;; (find-mortensentext (+ 10 33) "THREE MODULO INFINITY")
;; (find-mortensenpage (+ 10 33) " 1. The Classical Denumerable Nonstandard Model of Natural Number Arithmetic")
;; (find-mortensentext (+ 10 33) " 1. The Classical Denumerable Nonstandard Model of Natural Number Arithmetic")
;; (find-mortensenpage (+ 10 35) " 2. Inconsistency")
;; (find-mortensentext (+ 10 35) " 2. Inconsistency")
;; (find-mortensenpage (+ 10 39) "FOUR ORDER")
;; (find-mortensentext (+ 10 39) "FOUR ORDER")
;; (find-mortensenpage (+ 10 39) " 1. Order and Equality without Function Symbols")
;; (find-mortensentext (+ 10 39) " 1. Order and Equality without Function Symbols")
;; (find-mortensenpage (+ 10 40) " 2. Order and Equality with Function Symbols")
;; (find-mortensentext (+ 10 40) " 2. Order and Equality with Function Symbols")
;; (find-mortensenpage (+ 10 43) "FIVE CALCULUS")
;; (find-mortensentext (+ 10 43) "FIVE CALCULUS")
;; (find-mortensenpage (+ 10 43) " 1. Introduction")
;; (find-mortensentext (+ 10 43) " 1. Introduction")
;; (find-mortensenpage (+ 10 44) " 2. A Nilpotent Ring of Hyperreal Numbers")
;; (find-mortensentext (+ 10 44) " 2. A Nilpotent Ring of Hyperreal Numbers")
;; (find-mortensenpage (+ 10 47) " 3. An Incomplete Theory")
;; (find-mortensentext (+ 10 47) " 3. An Incomplete Theory")
;; (find-mortensenpage (+ 10 49) " 4. Incomplete Differential Calculus")
;; (find-mortensentext (+ 10 49) " 4. Incomplete Differential Calculus")
;; (find-mortensenpage (+ 10 55) " 5. Inconsistent Differential Calculus")
;; (find-mortensentext (+ 10 55) " 5. Inconsistent Differential Calculus")
;; (find-mortensenpage (+ 10 56) " 6. Integration")
;; (find-mortensentext (+ 10 56) " 6. Integration")
;; (find-mortensenpage (+ 10 58) " 7. Conclusion")
;; (find-mortensentext (+ 10 58) " 7. Conclusion")
;; (find-mortensenpage (+ 10 59) "SIX INCONSISTENT CONTINUOUS FUNCTIONS")
;; (find-mortensentext (+ 10 59) "SIX INCONSISTENT CONTINUOUS FUNCTIONS")
;; (find-mortensenpage (+ 10 59) " l. Introduction")
;; (find-mortensentext (+ 10 59) " l. Introduction")
;; (find-mortensenpage (+ 10 60) " 2. Functionality")
;; (find-mortensentext (+ 10 60) " 2. Functionality")
;; (find-mortensenpage (+ 10 63) " 3. Logic")
;; (find-mortensentext (+ 10 63) " 3. Logic")
;; (find-mortensenpage (+ 10 67) "SEVEN THE DELTA FUNCTION")
;; (find-mortensentext (+ 10 67) "SEVEN THE DELTA FUNCTION")
;; (find-mortensenpage (+ 10 67) " l. Introduction")
;; (find-mortensentext (+ 10 67) " l. Introduction")
;; (find-mortensenpage (+ 10 68) " 2. Functionality")
;; (find-mortensentext (+ 10 68) " 2. Functionality")
;; (find-mortensenpage (+ 10 73) "EIGHT INCONSISTENT SYSTEMS OF LINEAR EQUATIONS")
;; (find-mortensentext (+ 10 73) "EIGHT INCONSISTENT SYSTEMS OF LINEAR EQUATIONS")
;; (find-mortensenpage (+ 10 73) " l. Introduction")
;; (find-mortensentext (+ 10 73) " l. Introduction")
;; (find-mortensenpage (+ 10 73) " 2. The Inconsistent Case")
;; (find-mortensentext (+ 10 73) " 2. The Inconsistent Case")
;; (find-mortensenpage (+ 10 77) " 3. Control Theory")
;; (find-mortensentext (+ 10 77) " 3. Control Theory")
;; (find-mortensenpage (+ 10 80) " 4. Applications, Problems and Special Cases")
;; (find-mortensentext (+ 10 80) " 4. Applications, Problems and Special Cases")
;; (find-mortensenpage (+ 10 83) "NINE PROJECTIVE SPACES")
;; (find-mortensentext (+ 10 83) "NINE PROJECTIVE SPACES")
;; (find-mortensenpage (+ 10 83) " l. Introduction")
;; (find-mortensentext (+ 10 83) " l. Introduction")
;; (find-mortensenpage (+ 10 84) " 2. Vector Spaces")
;; (find-mortensentext (+ 10 84) " 2. Vector Spaces")
;; (find-mortensenpage (+ 10 86) " 3. Projective Geometry")
;; (find-mortensentext (+ 10 86) " 3. Projective Geometry")
;; (find-mortensenpage (+ 10 88) " 4. Projective Geometry Modulo Infinity")
;; (find-mortensentext (+ 10 88) " 4. Projective Geometry Modulo Infinity")
;; (find-mortensenpage (+ 10 93) "TEN TOPOLOGY")
;; (find-mortensentext (+ 10 93) "TEN TOPOLOGY")
;; (find-mortensenpage (+ 10 101) "ELEVEN CATEGORY THEORY")
;; (find-mortensentext (+ 10 101) "ELEVEN CATEGORY THEORY")
;; (find-mortensenpage (+ 10 101) " l. Introduction")
;; (find-mortensentext (+ 10 101) " l. Introduction")
;; (find-mortensenpage (+ 10 103) " 2. Closed Set Logic")
;; (find-mortensentext (+ 10 103) " 2. Closed Set Logic")
;; (find-mortensenpage (+ 10 104) " 3. Propositional Logic in a Category")
;; (find-mortensentext (+ 10 104) " 3. Propositional Logic in a Category")
;; (find-mortensenpage (+ 10 109) " 4. Implication")
;; (find-mortensentext (+ 10 109) " 4. Implication")
;; (find-mortensenpage (+ 10 112) " 5. Quantification Theory")
;; (find-mortensentext (+ 10 112) " 5. Quantification Theory")
;; (find-mortensenpage (+ 10 114) " 6. Conclusion")
;; (find-mortensentext (+ 10 114) " 6. Conclusion")
;; (find-mortensenpage (+ 10 115) "TWELVE CLOSED SET SHEAVES AND THEIR CATEGORIES")
;; (find-mortensentext (+ 10 115) "TWELVE CLOSED SET SHEAVES AND THEIR CATEGORIES")
;; (find-mortensenpage (+ 10 115) " 1. Introduction")
;; (find-mortensentext (+ 10 115) " 1. Introduction")
;; (find-mortensenpage (+ 10 116) " 2. Pretopologies and Topologies for Categories")
;; (find-mortensentext (+ 10 116) " 2. Pretopologies and Topologies for Categories")
;; (find-mortensenpage (+ 10 120) " 3. Subobject Classifiers")
;; (find-mortensentext (+ 10 120) " 3. Subobject Classifiers")
;; (find-mortensenpage (+ 10 123) " 4. Closed Set Sheaves")
;; (find-mortensentext (+ 10 123) " 4. Closed Set Sheaves")
;; (find-mortensenpage (+ 10 125) "THIRTEEN DUALITY")
;; (find-mortensentext (+ 10 125) "THIRTEEN DUALITY")
;; (find-mortensenpage (+ 10 129) "FOURTEEN FOUNDATIONS: PROVABILITY, TRUTH AND SETS")
;; (find-mortensentext (+ 10 129) "FOURTEEN FOUNDATIONS: PROVABILITY, TRUTH AND SETS")
;; (find-mortensenpage (+ 10 129) " 1. Introduction")
;; (find-mortensentext (+ 10 129) " 1. Introduction")
;; (find-mortensenpage (+ 10 130) " 2. Provability")
;; (find-mortensentext (+ 10 130) " 2. Provability")
;; (find-mortensenpage (+ 10 130) " 2.1 Consistent Preliminaries")
;; (find-mortensentext (+ 10 130) " 2.1 Consistent Preliminaries")
;; (find-mortensenpage (+ 10 132) " 2.2 The Inconsistent Case")
;; (find-mortensentext (+ 10 132) " 2.2 The Inconsistent Case")
;; (find-mortensenpage (+ 10 135) " 3. Truth")
;; (find-mortensentext (+ 10 135) " 3. Truth")
;; (find-mortensenpage (+ 10 135) " 3.1 The Fixed Point Method")
;; (find-mortensentext (+ 10 135) " 3.1 The Fixed Point Method")
;; (find-mortensenpage (+ 10 137) " 3.2 The Fixed Point Method Applied to Truth Theory")
;; (find-mortensentext (+ 10 137) " 3.2 The Fixed Point Method Applied to Truth Theory")
;; (find-mortensenpage (+ 10 139) " 3.3 The Proof that Fixed Points Model the T-scheme")
;; (find-mortensentext (+ 10 139) " 3.3 The Proof that Fixed Points Model the T-scheme")
;; (find-mortensenpage (+ 10 141) " 3.4 The Proof that there are Fixed Points")
;; (find-mortensentext (+ 10 141) " 3.4 The Proof that there are Fixed Points")
;; (find-mortensenpage (+ 10 141) " 4. The Fixed Point Method Applied to Set Theory")
;; (find-mortensentext (+ 10 141) " 4. The Fixed Point Method Applied to Set Theory")
;; (find-mortensenpage (+ 10 146) " 5. Further Applications")
;; (find-mortensentext (+ 10 146) " 5. Further Applications")
;; (find-mortensenpage (+ 10 147) "BIBLIOGRAPHY")
;; (find-mortensentext (+ 10 147) "BIBLIOGRAPHY")
;; «mummaphd» (to ".mummaphd")
;; (find-books "__logic/__logic.el" "mummaphd")
;; http://www.johnmumma.org/
;; http://www.johnmumma.org/Writings.html
;; http://www.johnmumma.org/Writings_files/Thesis.pdf
;; http://www.johnmumma.org/Home_files/New%20Research%20statement.pdf
(code-pdf-page "mummaphd" "$S/http/www.johnmumma.org/Writings_files/Thesis.pdf")
(code-pdf-text "mummaphd" "$S/http/www.johnmumma.org/Writings_files/Thesis.pdf")
;; (find-mummaphdpage)
;; (find-mummaphdtext)
;; mumma/panza:
;; https://link.springer.com/journal/11229/volumes-and-issues/186-1
;; «nederpelt» (to ".nederpelt")
;; «automath» (to ".automath")
;; (find-books "__logic/__logic.el" "automath")
;; (find-angg ".emacs.papers" "automath")
;; (to "typetheory")
;; https://www.win.tue.nl/automath/about_automath/mkm-compleet-klein.pdf
;; (find-LATEX "catsem.bib" "bib-Automath")
(code-pdf-page "automath" "~/books/__logic/nederpelt__selected_papers_on_automath.pdf")
(code-pdf-text "automath" "~/books/__logic/nederpelt__selected_papers_on_automath.pdf" 21)
;; (find-automathpage 12 "Contents")
;; (find-automathtext 12 "Contents")
;; (find-automathpage (+ 21 299) "Appendix 9 (AUT-SYNT)")
;; (find-automathtext (+ 21 299) "Appendix 9 (AUT-SYNT)")
;; (find-automathpage (+ 21 701) "Checking Landau's" "Grundlagen" "in the Automath System")
;; (find-automathtext (+ 21 701) "Checking Landau's" "Grundlagen" "in the Automath System")
;; (find-automathpage (+ 21 731) "this ratio can be kept constant")
;; (find-automathtext (+ 21 731) "this ratio can be kept constant")
;; (find-automathpage (+ 21 865) "Vernacular" "N.G. de Bruijn")
;; (find-automathtext (+ 21 865) "Vernacular" "N.G. de Bruijn")
;; (find-automathpage (+ 21 975) "References")
;; (find-automathtext (+ 21 975) "References")
;; (find-automathpage (+ 21 1005) "Index of subjects")
;; «nederpelt-geuvers» (to ".nederpelt-geuvers")
;; (find-books "__logic/__logic.el" "nederpelt-geuvers")
;; (find-LATEX "catsem-ab.bib" "bib-NederpeltGeuvers")
(code-pdf-page "ttafpai" "~/books/__logic/nederpelt_geuvers__type_theory_and_formal_proof_an_introduction.pdf")
(code-pdf-text "ttafpai" "~/books/__logic/nederpelt_geuvers__type_theory_and_formal_proof_an_introduction.pdf" 29)
;; (find-ttafpaipage)
;; (find-ttafpaitext "")
;; (find-ttafpaipage 8 "Contents")
;; (find-ttafpaitext 8 "Contents")
;; (find-ttafpaipage (+ 29 1) "1 Untyped lambda calculus")
;; (find-ttafpaipage (+ 29 1) "1.1 Input-output behaviour of functions")
;; (find-ttafpaipage (+ 29 2) "1.2 The essence of functions")
;; (find-ttafpaipage (+ 29 4) "1.3 Lambda-terms")
;; (find-ttafpaipage (+ 29 8) "1.4 Free and bound variables")
;; (find-ttafpaipage (+ 29 9) "1.5 Alpha conversion")
;; (find-ttafpaipage (+ 29 11) "1.6 Substitution")
;; (find-ttafpaipage (+ 29 14) "1.7 Lambda-terms modulo -equivalence")
;; (find-ttafpaipage (+ 29 16) "1.8 Beta reduction")
;; (find-ttafpaipage (+ 29 19) "1.9 Normal forms and confluence")
;; (find-ttafpaipage (+ 29 24) "1.10 Fixed Point Theorem")
;; (find-ttafpaipage (+ 29 26) "1.11 Conclusions")
;; (find-ttafpaipage (+ 29 27) "1.12 Further reading")
;; (find-ttafpaipage (+ 29 29) "Exercises")
;; (find-ttafpaipage (+ 29 33) "2 Simply typed lambda calculus")
;; (find-ttafpaipage (+ 29 33) "2.1 Adding types")
;; (find-ttafpaipage (+ 29 34) "2.2 Simple types")
;; (find-ttafpaipage (+ 29 36) "2.3 Church-typing and Curry-typing")
;; (find-ttafpaipage (+ 29 39) "2.4 Derivation rules for Church's")
;; (find-ttafpaipage (+ 29 44) "2.5 Different formats for a derivation in")
;; (find-ttafpaipage (+ 29 46) "2.6 Kinds of problems to be solved in type theory")
;; (find-ttafpaipage (+ 29 47) "2.7 Well-typedness in")
;; (find-ttafpaipage (+ 29 50) "2.8 Type Checking in")
;; (find-ttafpaipage (+ 29 51) "2.9 Term Finding in")
;; (find-ttafpaipage (+ 29 53) "2.10 General properties of")
;; (find-ttafpaipage (+ 29 59) "2.11 Reduction and")
;; (find-ttafpaipage (+ 29 63) "2.12 Consequences")
;; (find-ttafpaipage (+ 29 64) "2.13 Conclusions")
;; (find-ttafpaipage (+ 29 65) "2.14 Further reading")
;; (find-ttafpaipage (+ 29 66) "Exercises")
;; (find-ttafpaipage (+ 29 69) "3 Second order typed lambda calculus")
;; (find-ttafpaipage (+ 29 69) "3.1 Type-abstraction and type-application")
;; (find-ttafpaipage (+ 29 71) "3.2 -types")
;; (find-ttafpaipage (+ 29 72) "3.3 Second order abstraction and application rules")
;; (find-ttafpaipage (+ 29 73) "3.4 The system 2")
;; (find-ttafpaipage (+ 29 76) "3.5 Example of a derivation in 2")
;; (find-ttafpaipage (+ 29 78) "3.6 Properties of 2")
;; (find-ttafpaipage (+ 29 80) "3.7 Conclusions")
;; (find-ttafpaipage (+ 29 80) "3.8 Further reading")
;; (find-ttafpaipage (+ 29 82) "Exercises")
;; (find-ttafpaipage (+ 29 85) "4 Types dependent on types")
;; (find-ttafpaipage (+ 29 85) "4.1 Type constructors")
;; (find-ttafpaipage (+ 29 88) "4.2 Sort-rule and var-rule in")
;; (find-ttafpaipage (+ 29 90) "4.3 The weakening rule in")
;; (find-ttafpaipage (+ 29 93) "4.4 The formation rule in")
;; (find-ttafpaipage (+ 29 94) "4.5 Application and abstraction rules in")
;; (find-ttafpaipage (+ 29 95) "4.6 Shortened derivations")
;; (find-ttafpaipage (+ 29 97) "4.7 The conversion rule")
;; (find-ttafpaipage (+ 29 99) "4.8 Properties of")
;; (find-ttafpaipage (+ 29 100) "4.9 Conclusions")
;; (find-ttafpaipage (+ 29 100) "4.10 Further reading")
;; (find-ttafpaipage (+ 29 101) "Exercises")
;; (find-ttafpaipage (+ 29 103) "5 Types dependent on terms")
;; (find-ttafpaipage (+ 29 103) "5.1 The missing extension")
;; (find-ttafpaipage (+ 29 105) "5.2 Derivation rules of P")
;; (find-ttafpaipage (+ 29 107) "5.3 An example derivation in P")
;; (find-ttafpaipage (+ 29 109) "5.4 Minimal predicate logic in P")
;; (find-ttafpaipage (+ 29 115) "5.5 Example of a logical derivation in P")
;; (find-ttafpaipage (+ 29 118) "5.6 Conclusions")
;; (find-ttafpaipage (+ 29 119) "5.7 Further reading")
;; (find-ttafpaipage (+ 29 121) "Exercises")
;; (find-ttafpaipage (+ 29 123) "6 The Calculus of Constructions")
;; (find-ttafpaipage (+ 29 123) "6.1 The system C")
;; (find-ttafpaipage (+ 29 125) "6.2 The -cube")
;; (find-ttafpaipage (+ 29 127) "Figure 6.4 Derivation rules")
;; (find-ttafpaitext (+ 29 127) "Figure 6.4 Derivation rules")
;; (find-ttafpaipage (+ 29 128) "6.3 Properties of C")
;; (find-ttafpaipage (+ 29 132) "6.4 Conclusions")
;; (find-ttafpaipage (+ 29 133) "6.5 Further reading")
;; (find-ttafpaipage (+ 29 134) "Exercises")
;; (find-ttafpaipage (+ 29 137) "7 The encoding of logical notions in C")
;; (find-ttafpaipage (+ 29 137) "7.1 Absurdity and negation in type theory")
;; (find-ttafpaipage (+ 29 139) "7.2 Conjunction and disjunction in type theory")
;; (find-ttafpaipage (+ 29 144) "7.3 An example of propositional logic in C")
;; (find-ttafpaipage (+ 29 146) "7.4 Classical logic in C")
;; (find-ttafpaipage (+ 29 150) "7.5 Predicate logic in C")
;; (find-ttafpaipage (+ 29 154) "7.6 An example of predicate logic in C")
;; (find-ttafpaipage (+ 29 157) "7.7 Conclusions")
;; (find-ttafpaipage (+ 29 159) "7.8 Further reading")
;; (find-ttafpaipage (+ 29 162) "Exercises")
;; (find-ttafpaipage (+ 29 165) "8 Definitions")
;; (find-ttafpaipage (+ 29 165) "8.1 The nature of definitions")
;; (find-ttafpaipage (+ 29 167) "8.2 Inductive and recursive definitions")
;; (find-ttafpaipage (+ 29 168) "8.3 The format of definitions")
;; (find-ttafpaipage (+ 29 170) "8.4 Instantiations of definitions")
;; (find-ttafpaipage (+ 29 172) "8.5 A formal format for definitions")
;; (find-ttafpaipage (+ 29 174) "8.6 Definitions depending on assumptions")
;; (find-ttafpaipage (+ 29 175) "8.7 Giving names to proofs")
;; (find-ttafpaipage (+ 29 178) "8.8 A general proof and a specialised version")
;; (find-ttafpaipage (+ 29 179) "General theorem: (Bezout's Lemma)")
;; (find-ttafpaitext (+ 29 179) "General theorem: (Bezout's Lemma)")
;; (find-ttafpaipage (+ 29 180) "8.9 Mathematical statements as formal definitions")
;; (find-ttafpaipage (+ 29 182) "8.10 Conclusions")
;; (find-ttafpaipage (+ 29 183) "8.11 Further reading")
;; (find-ttafpaipage (+ 29 185) "Exercises")
;; (find-ttafpaipage (+ 29 189) "9 Extension of C with definitions")
;; (find-ttafpaipage (+ 29 189) "9.1 Extension of C to the system D0")
;; (find-ttafpaipage (+ 29 190) "9.2 Judgements extended with definitions")
;; (find-ttafpaipage (+ 29 191) "Definition 9.2.1 (Judgement with definitions; extended judgement)")
;; (find-ttafpaitext (+ 29 191) "Definition 9.2.1 (Judgement with definitions; extended judgement)")
;; (find-ttafpaipage (+ 29 192) "9.3 The rule for adding a definition")
;; (find-ttafpaipage (+ 29 193) "9.4 The rule for instantiating a definition")
;; (find-ttafpaipage (+ 29 197) "9.5 Definition unfolding and -conversion")
;; (find-ttafpaipage (+ 29 200) "9.6 Examples of -conversion")
;; (find-ttafpaipage (+ 29 202) "9.7 The conversion rule extended with")
;; (find-ttafpaipage (+ 29 203) "9.8 The derivation rules for D0")
;; (find-ttafpaipage (+ 29 204) "9.9 A closer look at the derivation rules of D0")
;; (find-ttafpaipage (+ 29 206) "9.10 Conclusions")
;; (find-ttafpaipage (+ 29 207) "9.11 Further reading")
;; (find-ttafpaipage (+ 29 208) "Exercises")
;; (find-ttafpaipage (+ 29 211) "10 Rules and properties of D")
;; (find-ttafpaipage (+ 29 211) "10.1 Descriptive versus primitive definitions")
;; (find-ttafpaipage (+ 29 212) "10.2 Axioms and axiomatic notions")
;; (find-ttafpaipage (+ 29 214) "10.3 Rules for primitive definitions")
;; (find-ttafpaipage (+ 29 215) "10.4 Properties of D")
;; (find-ttafpaipage (+ 29 219) "10.5 Normalisation and confluence in D")
;; (find-ttafpaipage (+ 29 221) "10.6 Conclusions")
;; (find-ttafpaipage (+ 29 221) "10.7 Further reading")
;; (find-ttafpaipage (+ 29 223) "Exercises")
;; (find-ttafpaipage (+ 29 225) "11 Flag-style natural deduction in D")
;; (find-ttafpaipage (+ 29 225) "11.1 Formal derivations in D")
;; (find-ttafpaipage (+ 29 228) "11.2 Comparing formal and flag-style D")
;; (find-ttafpaipage (+ 29 229) "11.3 Conventions about flag-style proofs in D")
;; (find-ttafpaipage (+ 29 232) "11.4 Introduction and elimination rules")
;; (find-ttafpaipage (+ 29 234) "11.5 Rules for constructive propositional logic")
;; (find-ttafpaipage (+ 29 237) "11.6 Examples of logical derivations in D")
;; (find-ttafpaipage (+ 29 239) "11.7 Suppressing unaltered parameter lists")
;; (find-ttafpaipage (+ 29 240) "11.8 Rules for classical propositional logic")
;; (find-ttafpaipage (+ 29 243) "11.9 Alternative natural deduction rules for")
;; (find-ttafpaipage (+ 29 246) "11.10 Rules for constructive predicate logic")
;; (find-ttafpaipage (+ 29 249) "11.11 Rules for classical predicate logic")
;; (find-ttafpaipage (+ 29 252) "11.12 Conclusions")
;; (find-ttafpaipage (+ 29 253) "11.13 Further reading")
;; (find-ttafpaipage (+ 29 254) "Exercises")
;; (find-ttafpaipage (+ 29 257) "12 Mathematics in D: a first attempt")
;; (find-ttafpaipage (+ 29 257) "12.1 An example to start with")
;; (find-ttafpaipage (+ 29 259) "12.2 Equality")
;; (find-ttafpaipage (+ 29 262) "12.3 The congruence property of equality")
;; (find-ttafpaipage (+ 29 264) "12.4 Orders")
;; (find-ttafpaipage (+ 29 266) "12.5 A proof about orders")
;; (find-ttafpaipage (+ 29 268) "12.6 Unique existence")
;; (find-ttafpaipage (+ 29 271) "12.7 The descriptor")
;; (find-ttafpaipage (+ 29 274) "12.8 Conclusions")
;; (find-ttafpaipage (+ 29 275) "12.9 Further reading")
;; (find-ttafpaipage (+ 29 276) "Exercises")
;; (find-ttafpaipage (+ 29 279) "13 Sets and subsets")
;; (find-ttafpaipage (+ 29 279) "13.1 Dealing with subsets in D")
;; (find-ttafpaipage (+ 29 282) "13.2 Basic set-theoretic notions")
;; (find-ttafpaipage (+ 29 287) "13.3 Special subsets")
;; (find-ttafpaipage (+ 29 288) "13.4 Relations")
;; (find-ttafpaipage (+ 29 291) "13.5 Maps")
;; (find-ttafpaipage (+ 29 295) "13.6 Representation of mathematical notions")
;; (find-ttafpaipage (+ 29 296) "13.7 Conclusions")
;; (find-ttafpaipage (+ 29 297) "13.8 Further reading")
;; (find-ttafpaipage (+ 29 302) "Exercises")
;; (find-ttafpaipage (+ 29 305) "14 Numbers and arithmetic in D")
;; (find-ttafpaipage (+ 29 305) "14.1 The Peano axioms for natural numbers")
;; (find-ttafpaipage (+ 29 308) "14.2 Introducing integers the axiomatic way")
;; (find-ttafpaipage (+ 29 313) "14.3 Basic properties of the `new' N")
;; (find-ttafpaipage (+ 29 316) "14.4 Integer addition")
;; (find-ttafpaipage (+ 29 320) "14.5 An example of a basic computation in D")
;; (find-ttafpaipage (+ 29 322) "14.6 Arithmetical laws for addition")
;; (find-ttafpaipage (+ 29 324) "14.7 Closure under addition for natural and negative numbers")
;; (find-ttafpaipage (+ 29 327) "14.8 Integer subtraction")
;; (find-ttafpaipage (+ 29 330) "14.9 The opposite of an integer")
;; (find-ttafpaipage (+ 29 332) "14.10 Inequality relations on Z")
;; (find-ttafpaipage (+ 29 335) "14.11 Multiplication of integers")
;; (find-ttafpaipage (+ 29 338) "14.12 Divisibility")
;; (find-ttafpaipage (+ 29 340) "14.13 Irrelevance of proof")
;; (find-ttafpaipage (+ 29 341) "14.14 Conclusions")
;; (find-ttafpaipage (+ 29 343) "14.15 Further reading")
;; (find-ttafpaipage (+ 29 344) "Exercises")
;; (find-ttafpaipage (+ 29 349) "15 An elaborated example")
;; (find-ttafpaipage (+ 29 349) "15.1 Formalising a proof of Bezout's Lemma")
;; (find-ttafpaipage (+ 29 352) "15.2 Preparatory work")
;; (find-ttafpaipage (+ 29 354) "15.3 Part I of the proof of Bezout's Lemma")
;; (find-ttafpaipage (+ 29 357) "15.4 Part II of the proof")
;; (find-ttafpaipage (+ 29 360) "15.5 Part III of the proof")
;; (find-ttafpaipage (+ 29 363) "15.6 The holes in the proof of Bezout's Lemma")
;; (find-ttafpaipage (+ 29 364) "15.7 The Minimum Theorem for Z")
;; (find-ttafpaipage (+ 29 369) "15.8 The Division Theorem")
;; (find-ttafpaipage (+ 29 371) "15.9 Conclusions")
;; (find-ttafpaipage (+ 29 373) "15.10 Further reading")
;; (find-ttafpaipage (+ 29 376) "Exercises")
;; (find-ttafpaipage (+ 29 379) "16 Further perspectives")
;; (find-ttafpaipage (+ 29 379) "16.1 Useful applications of D")
;; (find-ttafpaipage (+ 29 380) "16.2 Proof assistants based on type theory")
;; (find-ttafpaipage (+ 29 384) "16.3 Future of the field")
;; (find-ttafpaipage (+ 29 386) "16.4 Conclusions")
;; (find-ttafpaipage (+ 29 387) "16.5 Further reading")
;; (find-ttafpaipage (+ 29 391) "Appendix A Logic in D")
;; (find-ttafpaipage (+ 29 391) "A.1 Constructive propositional logic")
;; (find-ttafpaipage (+ 29 393) "A.2 Classical propositional logic")
;; (find-ttafpaipage (+ 29 395) "A.3 Constructive predicate logic")
;; (find-ttafpaipage (+ 29 396) "A.4 Classical predicate logic")
;; (find-ttafpaipage (+ 29 397) "Appendix B Arithmetical axioms, definitions and lemmas")
;; (find-ttafpaipage (+ 29 403) "Appendix C Two complete example proofs in D")
;; (find-ttafpaipage (+ 29 403) "C.1 Closure under addition in N")
;; (find-ttafpaipage (+ 29 405) "C.2 The Minimum Theorem")
;; (find-ttafpaipage (+ 29 409) "Appendix D Derivation rules for D")
;; (find-ttafpaipage (+ 29 411) "References")
;; (find-ttafpaipage (+ 29 419) "Index of names")
;; (find-ttafpaipage (+ 29 421) "Index of definitions")
;; (find-ttafpaipage (+ 29 423) "Index of symbols")
;; (find-ttafpaipage (+ 29 425) "Index of subjects")
;; (find-ttafpaitext "")
;; «negarestani» (to ".negarestani")
;; (find-books "__logic/__logic.el" "negarestani")
;; Reza Negarestani: "Intelligence and Spirit"
(code-pdf-page "negarestani" "~/books/__logic/negarestani__intelligence_and_spirit.pdf")
(code-pdf-text "negarestani" "~/books/__logic/negarestani__intelligence_and_spirit.pdf" 1)
;; (find-negarestanipage)
;; (find-negarestanipage 6 "Contents")
;; (find-negarestanipage (+ 9 1) "1. Between Conception and Transformation")
;; (find-negarestanipage (+ 8 87) "2. An Outside View of Ourselves as Experimental AGI (Problems, Concepts, and Models)")
;; (find-negarestanipage (+ 3 145) "3. This I, or We or It, the Thing, Which Speaks (Forms of Intuition)")
;; (find-negarestanipage (+ 2 201) "4. Some Unsettling Kantian News, as Delivered by Boltzmann (An Excursion into Time)")
;; (find-negarestanipage (+ 2 249) "5. This I, or We or It, the Thing, Which Speaks (Objectivity and Thought)")
;; (find-negarestanipage (+ 1 295) "6. This I, or We or It, the Thing, Which Speaks (Dasein of Geist)")
;; (find-negarestanipage (+ -1 339) "7. This I, or We or It, the Thing, Which Speaks (Language as Interaction as Computation)")
;; (find-negarestanipage (+ -1 358) "ludics")
;; (find-negarestanipage (+ 3 358) "ludics")
;; (find-negarestanipage (+ 2 405) "8. Philosophy of Intelligence")
;; (find-negarestanipage (+ 3 509) "Appendix: Quandaries of Induction in Philosophy of Knowledge, Philosophy of Mind, and Artificial Intelligence")
;; (find-negarestanipage (+ 5 553) "Bibliography")
;; (find-negarestanipage (+ 5 565) "Index of Names")
;; (find-negarestanipage (+ 4 569) "Index of Subjects")
;; (find-negarestanitext "")
;; «negri-vonplato» (to ".negri-vonplato")
;; (find-books "__logic/__logic.el" "negri-vonplato")
;; (find-LATEX "catsem-u.bib" "bib-NegriVonPlato")
(code-pdf-page "negrivpspf" "~/books/__logic/negri_vonplato__structural_proof_theory.pdf")
(code-pdf-text "negrivpspf" "~/books/__logic/negri_vonplato__structural_proof_theory.pdf" 19)
;; (find-negrivpspfpage)
;; (find-negrivpspftext)
;; (find-negrivpspfpage 6 "Contents")
;; (find-negrivpspfpage (+ 19 1) "1. FROM NATURAL DEDUCTION TO SEQUENT CALCULUS")
;; (find-negrivpspfpage (+ 19 1) "1.1. Logical systems")
;; (find-negrivpspfpage (+ 19 5) "1.2. Natural deduction")
;; (find-negrivpspfpage (+ 19 13) "1.3. From natural deduction to sequent calculus")
;; (find-negrivpspfpage (+ 19 20) "1.4. The structure of proofs")
;; (find-negrivpspfpage (+ 19 23) "Notes to Chapter 1")
;; (find-negrivpspfpage (+ 19 25) "2. SEQUENT CALCULUS FOR INTUITIONISTIC LOGIC")
;; (find-negrivpspfpage (+ 19 25) "2.1. Constructive reasoning")
;; (find-negrivpspfpage (+ 19 28) "2.2. Intuitionistic sequent calculus")
;; (find-negrivpspfpage (+ 19 30) "2.3. Proof methods for admissibility")
;; (find-negrivpspfpage (+ 19 33) "2.4. Admissibility of contraction and cut")
;; (find-negrivpspfpage (+ 19 40) "2.5. Some consequences of cut elimination")
;; (find-negrivpspfpage (+ 19 46) "Notes to Chapter 2")
;; (find-negrivpspfpage (+ 19 47) "3. SEQUENT CALCULUS FOR CLASSICAL LOGIC")
;; (find-negrivpspfpage (+ 19 48) "3.1. An invertible classical calculus")
;; (find-negrivpspfpage (+ 19 53) "3.2. Admissibility of structural rules")
;; (find-negrivpspfpage (+ 19 58) "3.3. Completeness")
;; (find-negrivpspfpage (+ 19 60) "Notes to Chapter 3")
;; (find-negrivpspfpage (+ 19 61) "4. THE QUANTIFIERS")
;; (find-negrivpspfpage (+ 19 61) "4.1. Quantifiers in natural deduction and in sequent calculus")
;; (find-negrivpspfpage (+ 19 64) "Quantifiers in natural deduction")
;; (find-negrivpspftext (+ 19 64) "Quantifiers in natural deduction")
;; (find-negrivpspfpage (+ 19 67) "G3i" "restriction")
;; (find-negrivpspftext (+ 19 67) "G3i" "restriction")
;; (find-negrivpspfpage (+ 19 70) "4.2. Admissibility of structural rules")
;; (find-negrivpspfpage (+ 19 76) "4.3. Applications of cut elimination")
;; (find-negrivpspfpage (+ 19 81) "4.4. Completeness of classical predicate logic")
;; (find-negrivpspfpage (+ 19 86) "Notes to Chapter 4")
;; (find-negrivpspfpage (+ 19 87) "5. VARIANTS OF SEQUENT CALCULI")
;; (find-negrivpspfpage (+ 19 87) "5.1. Sequent calculi with independent contexts")
;; (find-negrivpspfpage (+ 19 98) "5.2. Sequent calculi in natural deduction style")
;; (find-negrivpspfpage (+ 19 108) "5.3. An intuitionistic multisuccedent calculus")
;; (find-negrivpspfpage (+ 19 114) "5.4. A classical single succedent calculus")
;; (find-negrivpspfpage (+ 19 122) "5.5. A terminating intuitionistic calculus")
;; (find-negrivpspfpage (+ 19 124) "Notes to Chapter 5")
;; (find-negrivpspfpage (+ 19 126) "6. STRUCTURAL PROOF ANALYSIS OF AXIOMATIC THEORIES")
;; (find-negrivpspfpage (+ 19 126) "6.1. From axioms to rules")
;; (find-negrivpspfpage (+ 19 131) "6.2. Admissibility of structural rules")
;; (find-negrivpspfpage (+ 19 134) "6.3. Four approaches to extension by axioms")
;; (find-negrivpspfpage (+ 19 136) "6.4. Properties of cut-free derivations")
;; (find-negrivpspfpage (+ 19 138) "6.5. Predicate logic with equality")
;; (find-negrivpspfpage (+ 19 141) "6.6. Application to axiomatic systems")
;; (find-negrivpspfpage (+ 19 154) "Notes to Chapter 6")
;; (find-negrivpspfpage (+ 19 156) "7. INTERMEDIATE LOGICAL SYSTEMS")
;; (find-negrivpspfpage (+ 19 157) "7.1. A sequent calculus for the weak law of excluded middle")
;; (find-negrivpspfpage (+ 19 158) "7.2. A sequent calculus for stable logic")
;; (find-negrivpspfpage (+ 19 160) "7.3. Sequent calculi for Dummett logic")
;; (find-negrivpspfpage (+ 19 164) "Notes to Chapter 7")
;; (find-negrivpspfpage (+ 19 165) "8. BACK TO NATURAL DEDUCTION")
;; (find-negrivpspfpage (+ 19 166) "8.1. Natural deduction with general elimination rules")
;; (find-negrivpspfpage (+ 19 172) "8.2. Translation from sequent calculus to natural deduction")
;; (find-negrivpspfpage (+ 19 179) "8.3. Translation from natural deduction to sequent calculus")
;; (find-negrivpspfpage (+ 19 185) "8.4. Derivations with cuts and non-normal derivations")
;; (find-negrivpspfpage (+ 19 189) "8.5. The structure of normal derivations")
;; (find-negrivpspfpage (+ 19 202) "8.6. Classical natural deduction for propositional logic")
;; (find-negrivpspfpage (+ 19 208) "Notes to Chapter 8")
;; (find-negrivpspfpage (+ 19 211) "CONCLUSION: DIVERSITY AND UNITY IN STRUCTURAL PROOF THEORY")
;; (find-negrivpspfpage (+ 19 211) "Comparing sequent calculus and natural deduction")
;; (find-negrivpspfpage (+ 19 213) "A uniform logical calculus")
;; (find-negrivpspfpage (+ 19 219) "APPENDIX A: SIMPLE TYPE THEORY AND CATEGORIAL GRAMMAR")
;; (find-negrivpspfpage (+ 19 219) "A.I. Simple type theory")
;; (find-negrivpspfpage (+ 19 221) "A.2. Categorial grammar for logical languages")
;; (find-negrivpspfpage (+ 19 224) "Notes to Appendix A")
;; (find-negrivpspfpage (+ 19 225) "APPENDIX B: PROOF THEORY AND CONSTRUCTIVE TYPE THEORY")
;; (find-negrivpspfpage (+ 19 225) "B.I. Lower-level type theory")
;; (find-negrivpspfpage (+ 19 230) "B.2. Higher-level type theory")
;; (find-negrivpspfpage (+ 19 232) "B.3. Type systems")
;; (find-negrivpspfpage (+ 19 234) "Notes to Appendix B")
;; (find-negrivpspfpage (+ 19 235) "APPENDIX C: PESCA - A PROOF EDITOR FOR SEQUENT CALCULUS")
;; (find-negrivpspfpage (+ 19 235) "C.I. Introduction")
;; (find-negrivpspfpage (+ 19 236) "C.2. Two example sessions")
;; (find-negrivpspfpage (+ 19 239) "C.3. Some commands")
;; (find-negrivpspfpage (+ 19 241) "C.4. Axiom files")
;; (find-negrivpspfpage (+ 19 242) "C.5. On the implementation")
;; (find-negrivpspfpage (+ 19 243) "Notes to Appendix C")
;; (find-negrivpspfpage (+ 19 243) "Electronic references")
;; (find-negrivpspfpage (+ 19 245) "BIBLIOGRAPHY")
;; (find-negrivpspfpage (+ 19 251) "AUTHOR INDEX")
;; (find-negrivpspfpage (+ 19 253) "SUBJECT INDEX")
;; (find-negrivpspfpage (+ 19 257) "INDEX OF LOGICAL SYSTEMS")
;; (find-negrivpspfpage (+ 1 189) "Index")
;; (find-negrivpspftext "")
;; «nelson» (to ".nelson")
;; Edward Nelson: "Internal Set Theory: a New Approach to Nonstandard Analysis"
;; Bulletin of the American Mathematical Society - Volume 83, Number 6, November 1977
(code-pdf-page "nelsonist77" "$S/http/people.math.harvard.edu/~knill/various/nonstandard/nelson.pdf")
(code-pdf-text "nelsonist77" "$S/http/people.math.harvard.edu/~knill/various/nonstandard/nelson.pdf")
;; (find-nelsonist77page)
;; (find-nelsonist77text)
;; Unfinished book on nonstandard analysis:
;; https://web.math.princeton.edu/~nelson/books.html
;; https://web.math.princeton.edu/~nelson/books/1.pdf
;; «nolt-rohatyn» (to ".nolt-rohatyn")
;; (find-books "__logic/__logic.el" "nolt-rohatyn")
(code-djvu "noltro" "~/books/__logic/nolt_rohatyn__logica.djvu")
(code-djvutotext "noltro" "~/books/__logic/nolt_rohatyn__logica.djvu" 1)
;; (find-noltropage)
;; (find-noltropage 1 "Contents")
;; (find-noltropage (+ 1 189) "Index")
;; (find-noltrotext "")
;; «nordstrom» (to ".nordstrom")
;; Nordstrom, Petersson, Smith: "Programming in Martin-Löf type theory"
;; http://www.cs.chalmers.se/Cs/Research/Logic
;; https://www.dimap.ufrn.br/~regivan/pub/Programming_In_Martin_Loef_Type_Theory.pdf
(code-pdf-page "proginmltt" "$S/https/www.dimap.ufrn.br/~regivan/pub/Programming_In_Martin_Loef_Type_Theory.pdf")
(code-pdf-text "proginmltt" "$S/https/www.dimap.ufrn.br/~regivan/pub/Programming_In_Martin_Loef_Type_Theory.pdf" 10)
;; (find-proginmlttpage)
;; (find-proginmltttext)
;; (find-proginmlttpage 5 "Contents")
;; (find-proginmltttext 5 "Contents")
;; (find-proginmlttpage (+ 10 1) "Introduction")
;; (find-proginmlttpage (+ 10 27) "4.1.1 What does it mean to be a set?")
;; (find-proginmltttext (+ 10 27) "4.1.1 What does it mean to be a set?")
;; (find-proginmlttpage (+ 10 197) "Constants and their arities")
;; (find-proginmlttpage (+ 10 199) "Operational semantics")
;; «nye» (to ".nye")
;; (find-books "__logic/__logic.el" "nye")
;; Andrea Nye: "Words of Power: A Feminist Reading of the History of Logic"
;; https://www.routledge.com/Words-of-Power-A-Feminist-Reading-of-the-History-of-Logic/Nye/p/book/9780367426903
;; Mary Tiles's review: https://doi.org/10.1111/j.1468-0149.1992.tb00668.x
(code-pdf-page "nyewop" "~/books/__logic/nye__words_of_power_a_feminist_reading_of_the_history_of_logic.pdf")
(code-pdf-text "nyewop" "~/books/__logic/nye__words_of_power_a_feminist_reading_of_the_history_of_logic.pdf" 1)
;; (find-nyewoppage)
;; (find-nyewoppage 1 "Contents")
;; (find-nyewoppage (+ 1 189) "Index")
;; (find-nyewoptext "")
;; «oliva» (to ".oliva")
;; http://www.eecs.qmul.ac.uk/~pbo/
;; http://www.eecs.qmul.ac.uk/~pbo/research-pubs.html
;; http://www.eecs.qmul.ac.uk/~pbo/research-talks.html
;; http://www.eecs.qmul.ac.uk/~pbo/research-phd.html
;;
;; Proof Mining - Lecture 2: Proof Translations
;; http://www.eecs.qmul.ac.uk/~pbo/away-talks/2019_09_08Swansea2.pdf
;; (find-fline "$S/http/www.eecs.qmul.ac.uk/~pbo/away-talks/")
(code-pdf-page "olivapm2" "$S/http/www.eecs.qmul.ac.uk/~pbo/away-talks/2019_09_08Swansea2.pdf")
(code-pdf-text "olivapm2" "$S/http/www.eecs.qmul.ac.uk/~pbo/away-talks/2019_09_08Swansea2.pdf")
;; (find-olivapm2page)
;; (find-olivapm2page 16 "p/q = sqrt(2)")
;; (find-olivapm2text)
;; «open-logic» (to ".open-logic")
;; (find-books "__logic/__logic.el" "open-logic")
;; (find-es "tikz" "open-logic")
;; https://openlogicproject.org/
;; http://builds.openlogicproject.org/
;; http://builds.openlogicproject.org/open-logic-complete.pdf
(code-pdf-page "openlogic" "$S/http/builds.openlogicproject.org/open-logic-complete.pdf")
(code-pdf-text "openlogic" "$S/http/builds.openlogicproject.org/open-logic-complete.pdf" 1)
;; (find-openlogicpage)
;; (find-openlogictext)
;; (find-openlogicpage 3 "Contents")
;; (find-openlogictext 3 "Contents")
;; (find-openlogicpage (+ 1 562) "IX The Lambda Calculus")
;; (find-openlogicpage (+ 1 564) "39 Introduction")
;; (find-openlogicpage (+ 1 564) "39.1 Overview")
;; (find-openlogicpage (+ 1 565) "39.2 The Syntax of the Lambda Calculus")
;; (find-openlogicpage (+ 1 566) "39.3 Reduction of Lambda Terms")
;; (find-openlogicpage (+ 1 567) "39.4 The Church-Rosser Property")
;; (find-openlogicpage (+ 1 568) "39.5 Currying")
;; (find-openlogicpage (+ 1 569) "39.6 -Definable Arithmetical Functions")
;; (find-openlogicpage (+ 1 569) "39.7 -Definable Functions are Computable")
;; (find-openlogicpage (+ 1 570) "39.8 Computable Functions are -Definable")
;; (find-openlogicpage (+ 1 570) "39.9 The Basic Primitive Recursive Functions are -Definable")
;; (find-openlogicpage (+ 1 570) "39.10 The -Definable Functions are Closed under Composition")
;; (find-openlogicpage (+ 1 571) "39.11 -Definable Functions are Closed under Primitive Recursion")
;; (find-openlogicpage (+ 1 573) "39.12 Fixed-Point Combinators")
;; (find-openlogicpage (+ 1 574) "39.13 The -Definable Functions are Closed under Minimization")
;; (find-openlogicpage (+ 1 576) "40 Syntax")
;; (find-openlogicpage (+ 1 576) "40.1 Terms")
;; (find-openlogicpage (+ 1 576) "40.2 Unique Readability")
;; (find-openlogicpage (+ 1 578) "40.3 Abbreviated Syntax")
;; (find-openlogicpage (+ 1 578) "40.4 Free Variables")
;; (find-openlogicpage (+ 1 580) "40.5 Substitution")
;; (find-openlogicpage (+ 1 582) "40.6 -Conversion")
;; (find-openlogicpage (+ 1 586) "40.7 The De Bruijn Index")
;; (find-openlogicpage (+ 1 587) "40.8 Terms as -Equivalence Classes")
;; (find-openlogicpage (+ 1 588) "40.9 -reduction")
;; (find-openlogicpage (+ 1 590) "40.10 -conversion")
;; (find-openlogicpage (+ 1 592) "Problems")
;; (find-openlogicpage (+ 1 593) "41 The Church-Rosser Property")
;; (find-openlogicpage (+ 1 593) "41.1 Definition and Properties")
;; (find-openlogicpage (+ 1 594) "41.2 Parallel -reduction")
;; (find-openlogicpage (+ 1 596) "41.3 -reduction")
;; (find-openlogicpage (+ 1 598) "41.4 Parallel -reduction")
;; (find-openlogicpage (+ 1 599) "41.5 -reduction")
;; (find-openlogicpage (+ 1 599) "Problems")
;; (find-openlogicpage (+ 1 600) "42 Lambda Definability")
;; (find-openlogicpage (+ 1 600) "42.1 Introduction")
;; (find-openlogicpage (+ 1 601) "42.2 -Definable Arithmetical Functions")
;; (find-openlogicpage (+ 1 603) "42.3 Pairs and Predecessor")
;; (find-openlogicpage (+ 1 604) "42.4 Truth Values and Relations")
;; (find-openlogicpage (+ 1 605) "42.5 Primitive Recursive Functions are -Definable")
;; (find-openlogicpage (+ 1 607) "42.6 Fixpoints")
;; (find-openlogicpage (+ 1 610) "42.7 Minimization")
;; (find-openlogicpage (+ 1 611) "42.8 Partial Recursive Functions are -Definable")
;; (find-openlogicpage (+ 1 612) "42.9 -Definable Functions are Recursive")
;; (find-openlogicpage (+ 1 612) "Problems")
;; «paleo-delahaye» (to ".paleo-delahaye")
;; (find-books "__logic/__logic.el" "paleo-delahaye")
(code-pdf-page "aappfa" "~/books/__logic/paleo_delahaye__all_about_proofs_proofs_for_all.pdf")
(code-pdf-text "aappfa" "~/books/__logic/paleo_delahaye__all_about_proofs_proofs_for_all.pdf" 1)
;; (find-aappfapage)
;; (find-aappfapage 8 "Contents")
;; (find-aappfapage (+ 8 116) "Introduction to the calculus of inductive constructions" "Paulin-Mohring")
;; (find-aappfapage (+ 1 189) "Index")
;; (find-aappfatext "")
;; «papineau» (to ".papineau")
;; (find-books "__logic/__logic.el" "papineau")
;; https://imaginariopuro.wordpress.com/2018/12/21/metodos-formais-para-filosofos-novatos-mais-eficientes-que-logica/
(code-pdf "papipd" "~/books/__logic/papineau__philosophical_devices_proofs_probabilities_possibilities_and_sets.pdf")
(code-pdftotext "papipd" "~/books/__logic/papineau__philosophical_devices_proofs_probabilities_possibilities_and_sets.pdf" 21)
;; (find-papipdpage)
;; (find-papipdpage 8 "Contents")
;; (find-papipdtext 8 "Contents")
;; (find-papipdpage (+ 21 3) "1.")
;; (find-papipdpage (+ 21 189) "Index")
;; (find-papipdtext "")
;; «patterson» (to ".patterson")
;; (find-books "__logic/__logic.el" "patterson")
(code-pdf-page "pattersonaml" "~/books/__logic/patterson__aristotles_modal_logic_essence_and_entailment_in_the_organon.pdf")
(code-pdf-text "pattersonaml" "~/books/__logic/patterson__aristotles_modal_logic_essence_and_entailment_in_the_organon.pdf" 1)
;; (find-pattersonamlpage)
;; (find-pattersonamlpage 1 "Contents")
;; (find-pattersonamlpage (+ 1 189) "Index")
;; (find-pattersonamltext "")
;; «paulin-mohring» (to ".paulin-mohring")
;; (find-books "__logic/__logic.el" "paulin-mohring")
;; (find-es "coq" "CIC")
;; Christine Paulin-Mohring: "Introduction to the Calculus of Inductive Constructions" (2015)
;; https://hal.inria.fr/hal-01094195/
;; https://hal.inria.fr/hal-01094195/document
;; (find-fline "$S/https/hal.inria.fr/hal-01094195/")
(code-pdf-page "paulinmohringcic" "$S/https/hal.inria.fr/hal-01094195/document")
(code-pdf-text "paulinmohringcic" "$S/https/hal.inria.fr/hal-01094195/document")
;; (find-paulinmohringcicpage)
;; (find-paulinmohringcictext)
;; (find-paulinmohringcicpage 5 "2.2 Inductive Definitions")
;; (find-paulinmohringcictext 5 "2.2 Inductive Definitions")
;; «pelletier» (to ".pelletier")
;; https://www.sfu.ca/~jeffpell/papers/pelletierNDtexts.pdf
;; Francis Jeffry Pelletier: "A History of Natural Deduction and Elementary Logic Textbooks"
;; https://en.wikipedia.org/wiki/System_L
;; https://en.wikipedia.org/wiki/Natural_deduction#Tree-like_presentations
(code-pdf-page "pelletier" "$S/https/www.sfu.ca/~jeffpell/papers/pelletierNDtexts.pdf")
(code-pdf-text "pelletier" "$S/https/www.sfu.ca/~jeffpell/papers/pelletierNDtexts.pdf")
;; (find-pelletierpage)
;; (find-pelletiertext)
;; (find-pelletierpage 1 "1 Introduction")
;; (find-pelletiertext 1 "1 Introduction")
;; (find-pelletierpage 2 "2 The Concept of `Natural Deduction'")
;; (find-pelletiertext 2 "2 The Concept of `Natural Deduction'")
;; (find-pelletierpage 3 "3 Jaskowski and Gentzen")
;; (find-pelletiertext 3 "3 Jaskowski and Gentzen")
;; (find-pelletierpage 10 "4 Nine choice points in natural deduction systems")
;; (find-pelletiertext 10 "4 Nine choice points in natural deduction systems")
;; (find-pelletierpage 17 "5 Quine (and Rosser)")
;; (find-pelletiertext 17 "5 Quine (and Rosser)")
;; (find-pelletierpage 20 "6 Fitch")
;; (find-pelletiertext 20 "6 Fitch")
;; (find-pelletierpage 22 "7 Copi (and Rosser)")
;; (find-pelletiertext 22 "7 Copi (and Rosser)")
;; (find-pelletierpage 25 "8 Suppes")
;; (find-pelletiertext 25 "8 Suppes")
;; (find-pelletierpage 27 "9 The choice Points revisited")
;; (find-pelletiertext 27 "9 The choice Points revisited")
;; «pohlers» (to ".pohlers")
;; http://gigapedia.com/items/102823/proof-theory--an-introduction--lecture-notes-in-mathematics-
;; http://gigapedia.com/items/176028/proof-theory--the-first-step-into-impredicativity--universitext-
(code-xpdf "pohlersintro" "~/books/__logic/pohlers__proof_theory_an_introduction.pdf")
(code-xpdf "pohlersimpled" "~/books/__logic/pohlers__proof_theory_the_first_step_into_impredicativity.pdf")
;; (find-pohlersintropage 5 "Contents")
;; (find-pohlersintropage (+ 6 208) "Subject index")
;; (find-pohlersimpledpage 9 "Contents")
;; (find-pohlersimpledpage (+ 6 363) "Index")
;; «pradic-brown» (to ".pradic-brown")
;; Pierre Pradic / Chad E. Brown: "Cantor-Bernstein implies Excluded Middle" (2022)
;; https://arxiv.org/abs/1904.09193
;; https://arxiv.org/pdf/1904.09193.pdf
(code-pdf-page "pradicbrown" "$S/https/arxiv.org/pdf/1904.09193.pdf")
(code-pdf-text "pradicbrown" "$S/https/arxiv.org/pdf/1904.09193.pdf")
;; (find-pradicbrownpage)
;; (find-pradicbrowntext)
;; «prawitz» (to ".prawitz")
;; (find-books "__logic/__logic.el" "prawitz")
(code-pdf-page "prawitz" "~/books/__logic/prawitz__natural_deduction.pdf")
(code-pdf-text "prawitz" "~/books/__logic/prawitz__natural_deduction.pdf" 0)
;; (find-angg ".emacs.papers" "wadler-pat")
;; (find-prawitzpage 10 "Contents")
;; (find-prawitzpage (+ 0 19) "The corresponding natural deduction is given below")
;; (find-prawitzpage (+ 0 13) "I. Natural Deduction of Gentzen Type")
;; (find-prawitzpage (+ 0 20) "Restriction on the (Ex E)-rule")
;; (find-prawitzpage (+ 0 32) "II. The Inversion Principle")
;; (find-prawitzpage (+ 0 39) "III. Normal Deductions in Classical Logic")
;; (find-prawitzpage (+ 0 49) "IV. Normal Deductions in Intuitionistic Logic")
;; (find-prawitzpage (+ 0 63) "V. Second Order Logic")
;; (find-prawitzpage (+ 0 49) "Theorem on normal deductions")
;; (find-prawitzpage (+ 0 67) "Definability of and, or, ex and bot")
;; (find-prawitzpage (+ 0 72) "=")
;; (find-prawitzpage (+ 0 74) "VI. Modal Logic")
;; (find-prawitzpage (+ 0 90) "Connections between the calculus of sequents and the systems of natural deduction")
;; (find-prawitzpage (+ 0 94) "The originis of natural deduction")
;; (find-prawitzpage (+ 0 104) "Copi")
;; (find-prawitzpage (+ 0 110) "Index")
;; (find-prawitzpage)
;; (find-prawitzpage 1 "Contents")
;; (find-prawitzpage (+ 1 189) "Index")
;; (find-prawitztext "")
;; «priest» (to ".priest")
;; «priest-incl» (to ".priest-incl")
;; (find-books "__logic/__logic.el" "priest-incl")
(code-pdf-page "priestincl" "~/books/__logic/priest__an_introduction_to_non-classical_logic.pdf")
(code-pdf-text "priestincl" "~/books/__logic/priest__an_introduction_to_non-classical_logic.pdf" 1)
;; (find-priestinclpage)
;; (find-priestinclpage 9 "Contents")
;; (find-priestinclpage (+ 34 1) "Part I Propositional Logic")
;; (find-priestinclpage (+ 34 3) "1 Classical Logic and the Material Conditional")
;; (find-priestinclpage (+ 34 3) "1.1 Introduction")
;; (find-priestinclpage (+ 34 4) "1.2 The Syntax of the Object Language")
;; (find-priestinclpage (+ 34 5) "1.3 Semantic Validity")
;; (find-priestinclpage (+ 34 6) "1.4 Tableaux")
;; (find-priestinclpage (+ 34 10) "1.5 Counter-models")
;; (find-priestinclpage (+ 34 11) "1.6 Conditionals")
;; (find-priestinclpage (+ 34 12) "1.7 The Material Conditional")
;; (find-priestinclpage (+ 34 13) "1.8 Subjunctive and Counterfactual Conditionals")
;; (find-priestinclpage (+ 34 14) "1.9 More Counter-examples")
;; (find-priestinclpage (+ 34 15) "1.10 Arguments for")
;; (find-priestinclpage (+ 34 16) "1.11 Proofs of Theorems")
;; (find-priestinclpage (+ 34 18) "1.12 History")
;; (find-priestinclpage (+ 34 18) "1.13 Further Reading")
;; (find-priestinclpage (+ 34 18) "1.14 Problems")
;; (find-priestinclpage (+ 34 20) "2 Basic Modal Logic")
;; (find-priestinclpage (+ 34 20) "2.1 Introduction")
;; (find-priestinclpage (+ 34 20) "2.2 Necessity and Possibility")
;; (find-priestinclpage (+ 34 21) "2.3 Modal Semantics")
;; (find-priestinclpage (+ 34 24) "2.4 Modal Tableaux")
;; (find-priestinclpage (+ 34 28) "2.5 Possible Worlds: Representation")
;; (find-priestinclpage (+ 34 28) "2.6 Modal Realism")
;; (find-priestinclpage (+ 34 29) "2.7 Modal Actualism")
;; (find-priestinclpage (+ 34 30) "2.8 Meinongianism")
;; (find-priestinclpage (+ 34 31) "2.9 *Proofs of Theorems")
;; (find-priestinclpage (+ 34 33) "2.10 History")
;; (find-priestinclpage (+ 34 34) "2.11 Further Reading")
;; (find-priestinclpage (+ 34 34) "2.12 Problems")
;; (find-priestinclpage (+ 34 36) "3 Normal Modal Logics")
;; (find-priestinclpage (+ 34 36) "3.1 Introduction")
;; (find-priestinclpage (+ 34 36) "3.2 Semantics for Normal Modal Logics")
;; (find-priestinclpage (+ 34 38) "3.3 Tableaux for Normal Modal Logics")
;; (find-priestinclpage (+ 34 42) "3.4 Infinite Tableaux")
;; (find-priestinclpage (+ 34 45) "3.5 S5")
;; (find-priestinclpage (+ 34 46) "3.6 Which System Represents Necessity?")
;; (find-priestinclpage (+ 34 49) "3.6a The Tense Logic K t")
;; (find-priestinclpage (+ 34 51) "3.6b Extensions of K t")
;; (find-priestinclpage (+ 34 56) "3.7 *Proofs of Theorems")
;; (find-priestinclpage (+ 34 60) "3.8 History")
;; (find-priestinclpage (+ 34 60) "3.9 Further Reading")
;; (find-priestinclpage (+ 34 60) "3.10 Problems")
;; (find-priestinclpage (+ 34 64) "4 Non-normal Modal Logics; Strict Conditionals")
;; (find-priestinclpage (+ 34 64) "4.1 Introduction")
;; (find-priestinclpage (+ 34 64) "4.2 Non-normal Worlds")
;; (find-priestinclpage (+ 34 65) "4.3 Tableaux for Non-normal Modal Logics")
;; (find-priestinclpage (+ 34 67) "4.4 The Properties of Non-normal Logics")
;; (find-priestinclpage (+ 34 69) "4.4a S0.5")
;; (find-priestinclpage (+ 34 72) "4.5 Strict Conditionals")
;; (find-priestinclpage (+ 34 72) "4.6 The Paradoxes of Strict Implication")
;; (find-priestinclpage (+ 34 73) "4.7 and their Problems")
;; (find-priestinclpage (+ 34 74) "4.8 The Explosion of Contradictions")
;; (find-priestinclpage (+ 34 76) "4.9 Lewis' Argument for Explosion")
;; (find-priestinclpage (+ 34 77) "4.10 *Proofs of Theorems")
;; (find-priestinclpage (+ 34 79) "4.11 History")
;; (find-priestinclpage (+ 34 80) "4.12 Further Reading")
;; (find-priestinclpage (+ 34 80) "4.13 Problems")
;; (find-priestinclpage (+ 34 82) "5 Conditional Logics")
;; (find-priestinclpage (+ 34 82) "5.1 Introduction")
;; (find-priestinclpage (+ 34 82) "5.2 Some More Problematic Inferences")
;; (find-priestinclpage (+ 34 84) "5.3 Conditional Semantics")
;; (find-priestinclpage (+ 34 86) "5.4 Tableaux for C")
;; (find-priestinclpage (+ 34 87) "5.5 Extensions of C")
;; (find-priestinclpage (+ 34 90) "5.6 Similarity Spheres")
;; (find-priestinclpage (+ 34 94) "5.7 C1 and C2")
;; (find-priestinclpage (+ 34 97) "5.8 Further Philosophical Reflections")
;; (find-priestinclpage (+ 34 98) "5.9 *Proofs of Theorems")
;; (find-priestinclpage (+ 34 100) "5.10 History")
;; (find-priestinclpage (+ 34 101) "5.11 Further Reading")
;; (find-priestinclpage (+ 34 101) "5.12 Problems")
;; (find-priestinclpage (+ 34 103) "6 Intuitionist Logic")
;; (find-priestinclpage (+ 34 103) "6.1 Introduction")
;; (find-priestinclpage (+ 34 103) "6.2 Intuitionism: The Rationale")
;; (find-priestinclpage (+ 34 105) "6.3 Possible-world Semantics for Intuitionism")
;; (find-priestinclpage (+ 34 107) "6.4 Tableaux for Intuitionist Logic")
;; (find-priestinclpage (+ 34 112) "6.5 The Foundations of Intuitionism")
;; (find-priestinclpage (+ 34 113) "6.6 The Intuitionist Conditional")
;; (find-priestinclpage (+ 34 114) "6.7 *Proofs of Theorems")
;; (find-priestinclpage (+ 34 116) "6.8 History")
;; (find-priestinclpage (+ 34 117) "6.9 Further Reading")
;; (find-priestinclpage (+ 34 117) "6.10 Problems")
;; (find-priestinclpage (+ 34 120) "7 Many-valued Logics")
;; (find-priestinclpage (+ 34 120) "7.1 Introduction")
;; (find-priestinclpage (+ 34 120) "7.2 Many-valued Logic: The General Structure")
;; (find-priestinclpage (+ 34 122) "7.3 The 3-valued Logics of Kleene and Lukasiewicz")
;; (find-priestinclpage (+ 34 124) "7.4 LP and RM 3")
;; (find-priestinclpage (+ 34 125) "7.5 Many-valued Logics and Conditionals")
;; (find-priestinclpage (+ 34 127) "7.6 Truth-value Gluts: Inconsistent Laws")
;; (find-priestinclpage (+ 34 129) "7.7 Truth-value Gluts: Paradoxes of Self-reference")
;; (find-priestinclpage (+ 34 130) "7.8 Truth-value Gaps: Denotation Failure")
;; (find-priestinclpage (+ 34 132) "7.9 Truth-value Gaps: Future Contingents")
;; (find-priestinclpage (+ 34 133) "7.10 Supervaluations, Modality and Many-valued Logic")
;; (find-priestinclpage (+ 34 137) "7.11 *Proofs of Theorems")
;; (find-priestinclpage (+ 34 139) "7.12 History")
;; (find-priestinclpage (+ 34 140) "7.13 Further Reading")
;; (find-priestinclpage (+ 34 140) "7.14 Problems")
;; (find-priestinclpage (+ 34 142) "8 First Degree Entailment")
;; (find-priestinclpage (+ 34 142) "8.1 Introduction")
;; (find-priestinclpage (+ 34 142) "8.2 The Semantics of FDE")
;; (find-priestinclpage (+ 34 144) "8.3 Tableaux for FDE")
;; (find-priestinclpage (+ 34 146) "8.4 FDE and Many-valued Logics")
;; (find-priestinclpage (+ 34 149) "8.4a Relational Semantics and Tableaux for L 3 and RM 3")
;; (find-priestinclpage (+ 34 151) "8.5 The Routley Star")
;; (find-priestinclpage (+ 34 154) "8.6 Paraconsistency and the Disjunctive Syllogism")
;; (find-priestinclpage (+ 34 155) "8.7 *Proofs of Theorems")
;; (find-priestinclpage (+ 34 161) "8.8 History")
;; (find-priestinclpage (+ 34 161) "8.9 Further Reading")
;; (find-priestinclpage (+ 34 161) "8.10 Problems")
;; (find-priestinclpage (+ 34 163) "9 Logics with Gaps, Gluts and Worlds")
;; (find-priestinclpage (+ 34 163) "9.1 Introduction")
;; (find-priestinclpage (+ 34 163) "9.2 Adding")
;; (find-priestinclpage (+ 34 164) "9.3 Tableaux for K4")
;; (find-priestinclpage (+ 34 166) "9.4 Non-normal Worlds Again")
;; (find-priestinclpage (+ 34 168) "9.5 Tableaux for N4")
;; (find-priestinclpage (+ 34 169) "9.6 Star Again")
;; (find-priestinclpage (+ 34 171) "9.7 Impossible Worlds and Relevant Logic")
;; (find-priestinclpage (+ 34 175) "9.7a Logics of Constructible Negation")
;; (find-priestinclpage (+ 34 179) "9.8 *Proofs of Theorems")
;; (find-priestinclpage (+ 34 184) "9.9 History")
;; (find-priestinclpage (+ 34 185) "9.10 Further Reading")
;; (find-priestinclpage (+ 34 185) "9.11 Problems")
;; (find-priestinclpage (+ 34 188) "10 Relevant Logics")
;; (find-priestinclpage (+ 34 188) "10.1 Introduction")
;; (find-priestinclpage (+ 34 188) "10.2 The Logic B")
;; (find-priestinclpage (+ 34 190) "10.3 Tableaux for B")
;; (find-priestinclpage (+ 34 194) "10.4 Extensions of B")
;; (find-priestinclpage (+ 34 197) "10.4a Content Inclusion")
;; (find-priestinclpage (+ 34 203) "10.5 The System R")
;; (find-priestinclpage (+ 34 206) "10.6 The Ternary Relation")
;; (find-priestinclpage (+ 34 208) "10.7 Ceteris Paribus Enthymemes")
;; (find-priestinclpage (+ 34 211) "10.8 *Proofs of Theorems")
;; (find-priestinclpage (+ 34 216) "10.9 History")
;; (find-priestinclpage (+ 34 217) "10.10 Further Reading")
;; (find-priestinclpage (+ 34 218) "10.11 Problems")
;; (find-priestinclpage (+ 34 221) "11 Fuzzy Logics")
;; (find-priestinclpage (+ 34 221) "11.1 Introduction")
;; (find-priestinclpage (+ 34 221) "11.2 Sorites Paradoxes")
;; (find-priestinclpage (+ 34 222) "11.3 and Responses to Them")
;; (find-priestinclpage (+ 34 224) "11.4 The Continuum-valued Logic L")
;; (find-priestinclpage (+ 34 227) "11.5 Axioms for L")
;; (find-priestinclpage (+ 34 230) "11.6 Conditionals in L")
;; (find-priestinclpage (+ 34 231) "11.7 Fuzzy Relevant Logic")
;; (find-priestinclpage (+ 34 234) "11.7a *Appendix: t-norm Logics")
;; (find-priestinclpage (+ 34 237) "11.8 History")
;; (find-priestinclpage (+ 34 238) "11.9 Further Reading")
;; (find-priestinclpage (+ 34 239) "11.10 Problems")
;; (find-priestinclpage (+ 34 241) "11a Appendix: Many-valued Modal Logics")
;; (find-priestinclpage (+ 34 241) "11a.1 Introduction")
;; (find-priestinclpage (+ 34 241) "11a.2 General Structure")
;; (find-priestinclpage (+ 34 243) "11a.3 Illustration: Modal Lukasiewicz Logic")
;; (find-priestinclpage (+ 34 244) "11a.4 Modal FDE")
;; (find-priestinclpage (+ 34 247) "11a.5 Tableaux")
;; (find-priestinclpage (+ 34 250) "11a.6 Variations")
;; (find-priestinclpage (+ 34 251) "11a.7 Future Contingents Revisited")
;; (find-priestinclpage (+ 34 254) "11a.8 A Glimpse Beyond")
;; (find-priestinclpage (+ 34 255) "11a.9 *Proofs of Theorems")
;; (find-priestinclpage (+ 34 259) "Postscript: An Historical Perspective on Conditionals")
;; (find-priestinclpage (+ 34 261) "Part II Quantification and Identity")
;; (find-priestinclpage (+ 34 263) "12 Classical First-order Logic")
;; (find-priestinclpage (+ 34 263) "12.1 Introduction")
;; (find-priestinclpage (+ 34 263) "12.2 Syntax")
;; (find-priestinclpage (+ 34 264) "12.3 Semantics")
;; (find-priestinclpage (+ 34 266) "12.4 Tableaux")
;; (find-priestinclpage (+ 34 272) "12.5 Identity")
;; (find-priestinclpage (+ 34 275) "12.6 Some Philosophical Issues")
;; (find-priestinclpage (+ 34 277) "12.7 Some Final Technical Comments")
;; (find-priestinclpage (+ 34 278) "12.8 *Proofs of Theorems 1")
;; (find-priestinclpage (+ 34 283) "12.9 *Proofs of Theorems 2")
;; (find-priestinclpage (+ 34 285) "12.10 *Proofs of Theorems 3")
;; (find-priestinclpage (+ 34 287) "12.11 History")
;; (find-priestinclpage (+ 34 287) "12.12 Further Reading")
;; (find-priestinclpage (+ 34 288) "12.13 Problems")
;; (find-priestinclpage (+ 34 290) "13 Free Logics")
;; (find-priestinclpage (+ 34 290) "13.1 Introduction")
;; (find-priestinclpage (+ 34 290) "13.2 Syntax and Semantics")
;; (find-priestinclpage (+ 34 291) "13.3 Tableaux")
;; (find-priestinclpage (+ 34 293) "13.4 Free Logics: Positive, Negative and Neutral")
;; (find-priestinclpage (+ 34 295) "13.5 Quantification and Existence")
;; (find-priestinclpage (+ 34 297) "13.6 Identity in Free Logic")
;; (find-priestinclpage (+ 34 300) "13.7 *Proofs of Theorems")
;; (find-priestinclpage (+ 34 304) "13.8 History")
;; (find-priestinclpage (+ 34 305) "13.9 Further Reading")
;; (find-priestinclpage (+ 34 305) "13.10 Problems")
;; (find-priestinclpage (+ 34 308) "14 Constant Domain Modal Logics")
;; (find-priestinclpage (+ 34 308) "14.1 Introduction")
;; (find-priestinclpage (+ 34 308) "14.2 Constant Domain K")
;; (find-priestinclpage (+ 34 309) "14.3 Tableaux for CK")
;; (find-priestinclpage (+ 34 314) "14.4 Other Normal Modal Logics")
;; (find-priestinclpage (+ 34 315) "14.5 Modality De Re and De Dicto")
;; (find-priestinclpage (+ 34 318) "14.6 Tense Logic")
;; (find-priestinclpage (+ 34 320) "14.7 *Proofs of Theorems")
;; (find-priestinclpage (+ 34 325) "14.8 History")
;; (find-priestinclpage (+ 34 326) "14.9 Further Reading")
;; (find-priestinclpage (+ 34 327) "14.10 Problems")
;; (find-priestinclpage (+ 34 329) "15 Variable Domain Modal Logics")
;; (find-priestinclpage (+ 34 329) "15.1 Introduction")
;; (find-priestinclpage (+ 34 329) "15.2 Prolegomenon")
;; (find-priestinclpage (+ 34 330) "15.3 Variable Domain K and its Normal Extensions")
;; (find-priestinclpage (+ 34 331) "15.4 Tableaux for VK and its Normal Extensions")
;; (find-priestinclpage (+ 34 335) "15.5 Variable Domain Tense Logic")
;; (find-priestinclpage (+ 34 336) "15.6 Extensions")
;; (find-priestinclpage (+ 34 339) "15.7 Existence Across Worlds")
;; (find-priestinclpage (+ 34 341) "15.8 Existence and Wide-Scope Quantifiers")
;; (find-priestinclpage (+ 34 342) "15.9 *Proofs of Theorems")
;; (find-priestinclpage (+ 34 346) "15.10 History")
;; (find-priestinclpage (+ 34 346) "15.11 Further Reading")
;; (find-priestinclpage (+ 34 347) "15.12 Problems")
;; (find-priestinclpage (+ 34 349) "16 Necessary Identity in Modal Logic")
;; (find-priestinclpage (+ 34 349) "16.1 Introduction")
;; (find-priestinclpage (+ 34 350) "16.2 Necessary Identity")
;; (find-priestinclpage (+ 34 352) "16.3 The Negativity Constraint")
;; (find-priestinclpage (+ 34 354) "16.4 Rigid and Non-rigid Designators")
;; (find-priestinclpage (+ 34 357) "16.5 Names and Descriptions")
;; (find-priestinclpage (+ 34 358) "16.6 *Proofs of Theorems 1")
;; (find-priestinclpage (+ 34 362) "16.7 *Proofs of Theorems 2")
;; (find-priestinclpage (+ 34 364) "16.8 History")
;; (find-priestinclpage (+ 34 364) "16.9 Further Reading")
;; (find-priestinclpage (+ 34 365) "16.10 Problems")
;; (find-priestinclpage (+ 34 367) "17 Contingent Identity in Modal Logic")
;; (find-priestinclpage (+ 34 367) "17.1 Introduction")
;; (find-priestinclpage (+ 34 367) "17.2 Contingent Identity")
;; (find-priestinclpage (+ 34 373) "17.3 SI Again, and the Nature of Avatars")
;; (find-priestinclpage (+ 34 376) "17.4 *Proofs of Theorems")
;; (find-priestinclpage (+ 34 382) "17.5 History")
;; (find-priestinclpage (+ 34 382) "17.6 Further Reading")
;; (find-priestinclpage (+ 34 382) "17.7 Problems")
;; (find-priestinclpage (+ 34 384) "18 Non-normal Modal Logics")
;; (find-priestinclpage (+ 34 384) "18.1 Introduction")
;; (find-priestinclpage (+ 34 384) "18.2 Non-normal Modal Logics and Matrices")
;; (find-priestinclpage (+ 34 385) "18.3 Constant Domain Quantified L")
;; (find-priestinclpage (+ 34 386) "18.4 Tableaux for Constant Domain L")
;; (find-priestinclpage (+ 34 387) "18.5 Ringing the Changes")
;; (find-priestinclpage (+ 34 391) "18.6 Identity")
;; (find-priestinclpage (+ 34 393) "18.7 *Proofs of Theorems")
;; (find-priestinclpage (+ 34 397) "18.8 History")
;; (find-priestinclpage (+ 34 397) "18.9 Further Reading")
;; (find-priestinclpage (+ 34 397) "18.10 Problems")
;; (find-priestinclpage (+ 34 399) "19 Conditional Logics")
;; (find-priestinclpage (+ 34 399) "19.1 Introduction")
;; (find-priestinclpage (+ 34 399) "19.2 Constant and Variable Domain C")
;; (find-priestinclpage (+ 34 403) "19.3 Extensions")
;; (find-priestinclpage (+ 34 408) "19.4 Identity")
;; (find-priestinclpage (+ 34 413) "19.5 Some Philosophical Issues")
;; (find-priestinclpage (+ 34 415) "19.6 *Proofs of Theorems")
;; (find-priestinclpage (+ 34 419) "19.7 History")
;; (find-priestinclpage (+ 34 419) "19.8 Further Reading")
;; (find-priestinclpage (+ 34 419) "19.9 Problems")
;; (find-priestinclpage (+ 34 421) "20 Intuitionist Logic")
;; (find-priestinclpage (+ 34 421) "20.1 Introduction")
;; (find-priestinclpage (+ 34 421) "20.2 Existence and Construction")
;; (find-priestinclpage (+ 34 422) "20.3 Quantified Intuitionist Logic")
;; (find-priestinclpage (+ 34 424) "20.4 Tableaux for Intuitionist Logic 1")
;; (find-priestinclpage (+ 34 427) "20.5 Tableaux for Intuitionist Logic 2")
;; (find-priestinclpage (+ 34 431) "20.6 Mental Constructions")
;; (find-priestinclpage (+ 34 432) "20.7 Necessary Identity")
;; (find-priestinclpage (+ 34 434) "20.8 Intuitionist Identity")
;; (find-priestinclpage (+ 34 437) "20.9 *Proofs of Theorems 1")
;; (find-priestinclpage (+ 34 448) "20.10 *Proofs of Theorems 2")
;; (find-priestinclpage (+ 34 453) "20.11 History")
;; (find-priestinclpage (+ 34 453) "20.12 Further Reading")
;; (find-priestinclpage (+ 34 453) "20.13 Problems")
;; (find-priestinclpage (+ 34 456) "21 Many-valued Logics")
;; (find-priestinclpage (+ 34 456) "21.1 Introduction")
;; (find-priestinclpage (+ 34 456) "21.2 Quantified Many-valued Logics")
;; (find-priestinclpage (+ 34 457) "21.3 and")
;; (find-priestinclpage (+ 34 459) "21.4 Some 3-valued Logics")
;; (find-priestinclpage (+ 34 461) "21.5 Their Free Versions")
;; (find-priestinclpage (+ 34 462) "21.6 Existence and Quantification")
;; (find-priestinclpage (+ 34 465) "21.7 Neutral Free Logics")
;; (find-priestinclpage (+ 34 467) "21.8 Identity")
;; (find-priestinclpage (+ 34 468) "21.9 Non-classical Identity")
;; (find-priestinclpage (+ 34 469) "21.10 Supervaluations and Subvaluations")
;; (find-priestinclpage (+ 34 471) "21.11 *Proofs of Theorems")
;; (find-priestinclpage (+ 34 473) "21.12 History")
;; (find-priestinclpage (+ 34 474) "21.13 Further Reading")
;; (find-priestinclpage (+ 34 474) "21.14 Problems")
;; (find-priestinclpage (+ 34 476) "22 First Degree Entailment")
;; (find-priestinclpage (+ 34 476) "22.1 Introduction")
;; (find-priestinclpage (+ 34 476) "22.2 Relational and Many-valued Semantics")
;; (find-priestinclpage (+ 34 479) "22.3 Tableaux")
;; (find-priestinclpage (+ 34 481) "22.4 Free Logics with Relational Semantics")
;; (find-priestinclpage (+ 34 483) "22.5 Semantics with the Routley")
;; (find-priestinclpage (+ 34 486) "22.6 Identity")
;; (find-priestinclpage (+ 34 489) "22.7 *Proofs of Theorems 1")
;; (find-priestinclpage (+ 34 493) "22.8 *Proofs of Theorems 2")
;; (find-priestinclpage (+ 34 499) "22.9 *Proofs of Theorems 3")
;; (find-priestinclpage (+ 34 502) "22.10 History")
;; (find-priestinclpage (+ 34 502) "22.11 Further Reading")
;; (find-priestinclpage (+ 34 502) "22.12 Problems")
;; (find-priestinclpage (+ 34 504) "23 Logics with Gaps, Gluts and Worlds")
;; (find-priestinclpage (+ 34 504) "23.1 Introduction")
;; (find-priestinclpage (+ 34 505) "23.2 Matrix Semantics Again")
;; (find-priestinclpage (+ 34 505) "23.3 N4")
;; (find-priestinclpage (+ 34 508) "23.4 N")
;; (find-priestinclpage (+ 34 510) "23.5 K4 and K")
;; (find-priestinclpage (+ 34 512) "23.6 Relevant Identity")
;; (find-priestinclpage (+ 34 515) "23.7 Relevant Predication")
;; (find-priestinclpage (+ 34 517) "23.8 Logics with Constructible Negation")
;; (find-priestinclpage (+ 34 521) "23.9 Identity for Logics with Constructible Negation")
;; (find-priestinclpage (+ 34 523) "23.10 *Proofs of Theorems 1")
;; (find-priestinclpage (+ 34 527) "23.11 *Proofs of Theorems 2")
;; (find-priestinclpage (+ 34 530) "23.12 *Proofs of Theorems 3")
;; (find-priestinclpage (+ 34 532) "23.13 History")
;; (find-priestinclpage (+ 34 532) "23.14 Further Reading")
;; (find-priestinclpage (+ 34 533) "23.15 Problems")
;; (find-priestinclpage (+ 34 535) "24 Relevant Logics")
;; (find-priestinclpage (+ 34 535) "24.1 Introduction")
;; (find-priestinclpage (+ 34 535) "24.2 Quantified B")
;; (find-priestinclpage (+ 34 537) "24.3 Extensions of B")
;; (find-priestinclpage (+ 34 541) "24.4 Restricted Quantification")
;; (find-priestinclpage (+ 34 543) "24.5 Semantics vs Proof Theory")
;; (find-priestinclpage (+ 34 548) "24.6 Identity")
;; (find-priestinclpage (+ 34 553) "24.7 Properties of Identity")
;; (find-priestinclpage (+ 34 555) "24.8 *Proofs of Theorems 1")
;; (find-priestinclpage (+ 34 559) "24.9 *Proofs of Theorems 2")
;; (find-priestinclpage (+ 34 561) "24.10 History")
;; (find-priestinclpage (+ 34 561) "24.11 Further Reading")
;; (find-priestinclpage (+ 34 562) "24.12 Problems")
;; (find-priestinclpage (+ 34 564) "25 Fuzzy Logics")
;; (find-priestinclpage (+ 34 564) "25.1 Introduction")
;; (find-priestinclpage (+ 34 564) "25.2 Quantified Lukasiewicz Logic")
;; (find-priestinclpage (+ 34 565) "25.3 Validity in L")
;; (find-priestinclpage (+ 34 570) "25.4 Deductions")
;; (find-priestinclpage (+ 34 572) "25.5 The Sorites Again")
;; (find-priestinclpage (+ 34 573) "25.6 Fuzzy Identity")
;; (find-priestinclpage (+ 34 576) "25.7 Vague Objects")
;; (find-priestinclpage (+ 34 578) "t-norm Logics")
;; (find-priestinclpage (+ 34 581) "25.9 History")
;; (find-priestinclpage (+ 34 582) "25.10 Further Reading")
;; (find-priestinclpage (+ 34 582) "25.11 Problems")
;; (find-priestinclpage (+ 34 584) "Postscript: A Methodological Coda")
;; (find-priestinclpage (+ 34 587) "References")
;; (find-priestinclpage (+ 34 603) "Index of Names")
;; (find-priestinclpage (+ 34 607) "Index of Subjects")
;; (find-priestincltext "")
;; (find-books "__logic/__logic.el" "priest")
(code-pdf "priestlvf" "~/books/__logic/priest__logic_a_very_short_introduction.pdf")
(code-pdftotext "priestlvf" "~/books/__logic/priest__logic_a_very_short_introduction.pdf" 15)
;; (find-priestlvfpage)
;; (find-priestlvfpage 10 "Contents")
;; (find-priestlvfpage (+ 15 1) "1. Validity")
;; (find-priestlvfpage (+ 15 123) "General Index")
;; (find-priestlvftext "")
;; «reid» (to ".reid")
;; (find-books "__logic/__logic.el" "reid")
;; http://www.math.uni-bremen.de/didaktik/ma/dreid/publikationen_en.html
(code-pdf-page "reidmopime" "~/books/__logic/reid__the_meaning_of_proof_in_mathematics_education.pdf")
(code-pdf-text "reidmopime" "~/books/__logic/reid__the_meaning_of_proof_in_mathematics_education.pdf" 1)
;; (find-reidmopimepage)
;; (find-reidmopimepage 1 "Contents")
;; (find-reidmopimepage (+ 1 189) "Index")
;; (find-reidmopimetext "")
;; «restall» (to ".restall")
;; (find-books "__logic/__logic.el" "restall")
;; https://epdf.pub/an-introduction-to-substructural-logics.html
(code-pdf-page "restallisubl" "~/books/__logic/restall__an_introduction_to_substructural_logics.pdf")
(code-pdf-text "restallisubl" "~/books/__logic/restall__an_introduction_to_substructural_logics.pdf" 1)
;; (find-restallisublpage)
;; (find-restallisublpage 6 "Contents")
;; (find-restallisublpage (+ 1 189) "Index")
;; (find-restallisubltext "")
;; «reynolds» (to ".reynolds")
;; (find-books "__logic/__logic.el" "reynolds")
;; See: (find-angg ".emacs.papers" "wadler-free")
;; https://github.com/jozefg/learn-tt - a selection
;;
;; Reynolds: "Polymorphism is not Set-Theoretic"
;; https://doi.org/10.1007/3-540-13346-1_7
;; http://h2.jaguarpaw.co.uk/posts/polymorphism-is-not-set-theoretic/
(code-pdf-page "pinst" "~/books/__logic/reynolds__polymorphism_is_not_set-theoretic.pdf")
(code-pdf-text "pinst" "~/books/__logic/reynolds__polymorphism_is_not_set-theoretic.pdf" -144)
;; (find-pinstpage)
;; (find-pinstpage (+ -142 145) "Introduction")
;; (find-pinsttext "")
;;
;; Reynolds-Plotkin: "On Functors Expressible in the Polymorphic Typed Lambda Calculus" (1991)
;; http://homepages.inf.ed.ac.uk/gdp/publications/Functors_Expressible_Polymorphic.pdf
(code-pdf-page "reynoldspfep" "$S/http/homepages.inf.ed.ac.uk/gdp/publications/Functors_Expressible_Polymorphic.pdf")
(code-pdf-text "reynoldspfep" "$S/http/homepages.inf.ed.ac.uk/gdp/publications/Functors_Expressible_Polymorphic.pdf")
;; (find-reynoldspfeppage)
;; (find-reynoldspfeptext)
;;
;; Reynolds: "Types, Abstraction, and Parametric Polymorphism" (1983)
;; http://www.cse.chalmers.se/edu/year/2010/course/DAT140_Types/Reynolds_typesabpara.pdf
(code-pdf-page "reynoldstapp" "$S/http/www.cse.chalmers.se/edu/year/2010/course/DAT140_Types/Reynolds_typesabpara.pdf")
;; (find-reynoldstapppage)
;; «robinson» (to ".robinson")
;; (find-LATEX "filters.bib" "robinson")
;; http://gigapedia.com/items/255512/introduction-to-model-theory-and-to-the-metamathematics-of-algebra--studies-in-logic-and-the-foundations-of-mathematics-
;; http://gigapedia.com/items/255510/non-standard-analysis--studies-in-logic-and-the-foundations-of-mathematics-
(code-xpdf "robinsonmtma" "~/books/__logic/robinson__introduction_to_model_theory_and_to_the_metamathematics_of_algebra.pdf")
(code-xpdf "robinsonnsa" "~/books/__logic/robinson__non-standard_analysis.pdf")
;; (find-robinsonmtmapage (+ 4 1) "Chapter 1")
;; (find-robinsonmtmapage (+ 4 244) "9.4. Non-standard analysis")
;; (find-robinsonnsapage (+ 6 1) "Chapter 1")
;; (find-robinsonnsapage (+ 6 292) "Subject Index")
;; «rose-shepherdson» (to ".rose-shepherdson")
;; http://gigle.ws/logic-colloquium--039-73-proceedings-of-the-logic-colloquium-bristol-july-1973_.1086791.html
(code-xpdf "logiccolloquim73" "~/books/__logic/rose_shepherdson__logic_colloquim_73.pdf")
(code-pdftotext "logiccolloquim73" "~/books/__logic/rose_shepherdson__logic_colloquim_73.pdf")
;; (find-logiccolloquim73page 1 "Contents")
;; (find-logiccolloquim73page (+ 1 5) "Bernays")
;; (find-logiccolloquim73page (+ 5 5) "Dummett")
;; (find-logiccolloquim73page (+ 3 43) "Robinson")
;; (find-logiccolloquim73page (+ 2 75) "Martin-Löf")
;; (find-logiccolloquim73page (+ 2 121) "MacLane")
;; (find-logiccolloquim73page (+ 2 137) "Lawvere")
;; (find-logiccolloquim73page (+ 4 157) "Milner")
;; (find-logiccolloquim73page (+ 3 175) "Elgot")
;; (find-logiccolloquim73page (+ 3 231) "Engeler")
;; (find-logiccolloquim73page (+ 3 432) "Seldin")
;; (find-logiccolloquim73text "")
;; «russell» (to ".russell")
(code-pdf "russellml" "~/books/__logic/russell__mysticism_and_logic.pdf")
(code-pdftotext "russellml" "~/books/__logic/russell__mysticism_and_logic.pdf" 1)
;; (find-russellmlpage)
;; (find-russellmlpage 1 "Contents")
;; (find-russellmlpage (+ 1 189) "Index")
;; (find-russellmltext "")
;; «sambin-smith» (to ".sambin-smith")
;; «ctt» (to ".ctt")
;; https://www.math.unipd.it/~sambin/logic.html
(code-xpdf "25yctt" "~/books/__logic/sambin_smith__25_years_of_constructive_type_theory.pdf")
;; (find-25ycttpage 5 "Preface")
;; (find-25ycttpage 8 "Contents")
;; (find-25ycttpage (+ 8 83) "Hoffman" "Streicher" "The grupoid interpretation of type theory")
;; (find-25ycttpage (+ 8 127) "An intuitionistic theory of types" "Per Martin-Löf")
;; (find-25ycttpage (+ 8 133) "An intuitionistic theory of types" "Girard's paradox")
;; (find-25ycttpage (+ 8 191) "On universes in type theory" "Erik Palmgren")
;; (find-25ycttpage (+ 8 221) "Building up a toolbox for Martin-Löf's Type Theory: subset theory" "Sambin" "Valentini")
;; «saracino-weispfenning» (to ".saracino-weispfenning")
;; http://gigapedia.com/items/72741/model-theory-and-algebra--a-memorial-tribute-to-abraham-robinson--lecture-notes-in-mathematics---498-
(code-djvu "slnm498" "~/books/__logic/saracino_weispfenning_eds__model_theory_and_algebra_slnm0498.djvu")
;; (find-slnm498page 6 "Contents")
;; (find-slnm498page (+ 7 14) "Algorithms in Algebra")
;; «scheele» (to ".scheele")
;; (find-books "__logic/__logic.el" "scheele")
(code-pdf "sheelealc" "~/books/__logic/scheele__model_and_proof_theory_of_constructive_ALC.pdf")
(code-pdftotext "sheelealc" "~/books/__logic/scheele__model_and_proof_theory_of_constructive_ALC.pdf" 1)
;; (find-sheelealcpage)
;; (find-sheelealcpage 10 "Abstract")
;; (find-sheelealcpage 16 "Contents")
;; (find-sheelealcpage (+ 1 189) "Index")
;; (find-sheelealctext "")
;; «second-order» (to ".second-order")
;; https://plato.stanford.edu/entries/logic-higher-order/
;; Väänänen, Jouko: "Second-order and Higher-order Logic"
;; «shieh» (to ".shieh")
;; (find-books "__logic/__logic.el" "shieh")
;; https://ndpr.nd.edu/news/necessity-lost/
(code-pdf-page "necessitylost" "~/books/__logic/shieh__necessity_lost_modality_and_logic_in_early_analytic_philosophy_vol_1.pdf")
(code-pdf-text "necessitylost" "~/books/__logic/shieh__necessity_lost_modality_and_logic_in_early_analytic_philosophy_vol_1.pdf" 25)
;; (find-necessitylostpage)
;; (find-necessitylostpage 8 "Contents")
;; (find-necessitylosttext 8 "Contents")
;; (find-necessitylostpage (+ 1 189) "Index")
;; (find-necessitylosttext "")
;; «shin» (to ".shin")
;; (find-books "__logic/__logic.el" "shin")
;; https://link.springer.com/article/10.1007/s11229-012-0075-1
(code-pdf-page "shinfi" "~/books/__logic/shin__the_forgotten_individual_diagrammatic_reasoning_in_mathematics.pdf")
(code-pdf-text "shinfi" "~/books/__logic/shin__the_forgotten_individual_diagrammatic_reasoning_in_mathematics.pdf" 1)
;; (find-shinfipage)
;; (find-shinfipage 1 "Contents")
;; (find-shinfipage (+ 1 189) "Index")
;; (find-shinfitext "")
;; «smith» (to ".smith")
;; (find-books "__cats/__cats.el" "smith")
;; (find-books "__logic/__logic.el" "smith")
;; Peter Smith: "Teach Yourself Logic"
;; https://www.logicmatters.net/tyl/
;; https://www.logicmatters.net/resources/pdfs/TeachYourselfLogic2017.pdf
;; https://www.logicmatters.net/resources/pdfs/LogicStudyGuide.pdf
;; https://www.logicmatters.net/resources/pdfs/Appendix.pdf
;; https://www.logicmatters.net/tyl/booknotes/
;; (find-fline "$S/https/www.logicmatters.net/resources/pdfs/")
(code-xpdf "tyl" "$S/https/www.logicmatters.net/resources/pdfs/TeachYourselfLogic2017.pdf")
(code-pdf-text "tyl" "$S/https/www.logicmatters.net/resources/pdfs/TeachYourselfLogic2017.pdf")
(code-xpdf "tyla" "$S/https/www.logicmatters.net/resources/pdfs/Appendix.pdf")
(code-pdf-text "tyla" "$S/https/www.logicmatters.net/resources/pdfs/Appendix.pdf")
(code-pdf-page "lsg" "$S/https/www.logicmatters.net/resources/pdfs/LogicStudyGuide.pdf")
(code-pdf-text "lsg" "$S/https/www.logicmatters.net/resources/pdfs/LogicStudyGuide.pdf")
;; (find-lsgpage)
;; (find-lsgtext)
;; (find-tylpage)
;; (find-tyltext)
;; (find-tylapage)
;; (find-tylatext)
;; «smith-ifl» (to ".smith-ifl")
;; https://www.logicmatters.net/ifl/
;; https://www.logicmatters.net/resources/pdfs/IFL2_LM.pdf
(code-pdf-page "smithifl" "$S/https/www.logicmatters.net/resources/pdfs/IFL2_LM.pdf")
(code-pdf-text "smithifl" "$S/https/www.logicmatters.net/resources/pdfs/IFL2_LM.pdf")
;; (find-smithiflpage)
;; (find-smithifltext)
;; (find-smithiflpage 5 "Contents")
;; (find-smithifltext 5 "Contents")
;; «smith-igt» (to ".smith-igt")
;; https://www.logicmatters.net/igt/
;; https://www.logicmatters.net/resources/pdfs/godelbook/GodelBookLM.pdf
;; (find-fline "$S/https/www.logicmatters.net/resources/pdfs/godelbook/")
(code-pdf-page "smithigt" "$S/https/www.logicmatters.net/resources/pdfs/godelbook/GodelBookLM.pdf")
(code-pdf-text "smithigt" "$S/https/www.logicmatters.net/resources/pdfs/godelbook/GodelBookLM.pdf")
;; (find-smithigtpage)
;; (find-smithigttext)
;; «smullyan» (to ".smullyan")
;; (find-books "__logic/__logic.el" "smullyan")
(code-pdf "smullyanfol" "~/books/__logic/smullyan__first-order_logic.pdf")
(code-pdftotext "smullyanfol" "~/books/__logic/smullyan__first-order_logic.pdf" 14)
;; (find-smullyanfolpage)
;; (find-smullyanfolpage 13 "Contents")
;; (find-smullyanfolpage (+ 14 3) "Index")
;; (find-smullyanfolpage (+ 14 15) "II. Analytic Tableaux")
;; (find-smullyanfolpage (+ 14 157) "Index")
;; (find-smullyanfoltext "")
(code-pdf-page "smullyanmock" "~/books/__logic/smullyan__to_mock_a_mockingbird.pdf")
(code-pdf-text "smullyanmock" "~/books/__logic/smullyan__to_mock_a_mockingbird.pdf" 1)
;; (find-smullyanmockpage)
;; (find-smullyanmockpage 9 "Contents")
;; (find-smullyanmockpage (+ 14 3) "1")
;; (find-smullyanmocktext "")
;; «spencer-brown» (to ".spencer-brown")
;; (find-books "__logic/__logic.el" "spencer-brown")
(code-pdf "lawsofform" "~/books/__logic/spencer-brown__laws_of_form.pdf")
(code-pdftotext "lawsofform" "~/books/__logic/spencer-brown__laws_of_form.pdf" 26)
;; (find-lawsofformpage)
;; (find-lawsofformpage 3 "Contents")
;; (find-lawsofformpage (+ 26 138) "Index of forms")
;; (find-lawsofformtext "")
;; «steinhart» (to ".steinhart")
;; (find-books "__logic/__logic.el" "steinhart")
;; http://ericsteinhart.com/TOOLS/tools-home.html
;; https://imaginariopuro.wordpress.com/2018/12/21/metodos-formais-para-filosofos-novatos-mais-eficientes-que-logica/
(code-pdf "moreprecisely" "~/books/__logic/steinhart__more_precisley_the_math_you_need_to_do_philosophy_2nd_ed.pdf")
(code-pdftotext "moreprecisely" "~/books/__logic/steinhart__more_precisley_the_math_you_need_to_do_philosophy_2nd_ed.pdf" 12)
;; (find-morepreciselypage)
;; (find-morepreciselypage 5 "Contents")
;; (find-morepreciselypage (+ 12 231) "Index")
;; (find-morepreciselytext "")
;; «stenlund» (to ".stenlund")
;; http://gigapedia.com/items/39544/combinators--lambda-terms-and-proof-theory--synthese-library-
(code-djvu "stenlund" "~/books/__logic/stenlund__combinators_lambda_terms_and_proof_theory.djvu")
;; (find-stenlundpage 7 "Contents")
;; (find-stenlundpage (+ 0 71) "combinatorial completeness" "deductive completeness")
;; (find-stenlundpage (+ 0 92) "combinatorial definability")
;; (find-stenlundpage (+ 0 182) "Index")
;; «stroyan» (to ".stroyan")
;; http://gigapedia.com/items/108825/mathematical-background--foundations-of-infinitesimal-calculus--2nd-edition
(code-xpdf "stroyanbg" "~/books/__logic/stroyan__mathematical_background__foundations_of_infinitesimal_calculus.pdf")
(code-pdftotext "stroyanbg" "~/books/__logic/stroyan__mathematical_background__foundations_of_infinitesimal_calculus.pdf")
;; (find-stroyanbgpage 1 "Contents")
;; (find-stroyanbgpage (+ 1 1) "Index")
;; (find-stroyanbgtext "")
;; «stroyan-luxemburg» (to ".stroyan-luxemburg")
;; http://gigapedia.com/items/362432/introduction-to-the-theory-of-infinitesimals--pure-and-applied-mathematics--a-series-of-monographs-and-textbooks--72-
(code-xpdf "stroyanluxemburg" "~/books/__logic/stroyan_luxemburg__introduction_to_the_theory_of_infinitesimals.pdf")
(code-pdftotext "stroyanluxemburg" "~/books/__logic/stroyan_luxemburg__introduction_to_the_theory_of_infinitesimals.pdf")
;; (find-stroyanluxemburgpage 8 "Contents")
;; (find-stroyanluxemburgpage (+ 17 323) "Index")
;; (find-stroyanluxemburgtext "")
;; «szabo-arpad» (to ".szabo-arpad")
;; (find-books "__logic/__logic.el" "szabo-arpad")
(code-pdf-page "szabobeg" "~/books/__logic/szabo__the_beginnings_of_greek_mathematics.pdf")
(code-pdf-text "szabobeg" "~/books/__logic/szabo__the_beginnings_of_greek_mathematics.pdf" 1)
;; (find-szabobegpage)
;; (find-szabobegpage 2 "Contents")
;; (find-szabobegpage (+ -95 185) "3.1. Proof in Greek mathematics")
;; (find-szabobegpage (+ 1 189) "Index")
;; (find-szabobegtext "")
;; «tarski» (to ".tarski")
;; http://gigapedia.com/items/113463/introduction-to-logic-and-to-the-methodology-of-the-deductive-sciences--oxford-logic-guides-
(code-djvu "tarskilameds" "~/books/__logic/tarski__introduction_to_logic_and_to_the_methodology_of_the_deductive_sciences.djvu")
;; (find-tarskilamedspage 6 "Contents")
;; (find-tarskilamedspage (+ 25 3) "Index")
;; (find-tarskilamedspage (+ 25 213) "Index")
;; «tarskiaot» (to ".tarskiaot")
;; https://www.dimap.ufrn.br/~jmarcos/papers/AoT-McKinsey_Tarski.pdf
;; McKinsey/Tarski: The Algebra of Topology (1944)
;; http://www.jstor.org/stable/1969080
;; (find-fline "$S/https/www.dimap.ufrn.br/~jmarcos/papers/")
(code-xpdf "tarskiaot" "$S/https/www.dimap.ufrn.br/~jmarcos/papers/AoT-McKinsey_Tarski.pdf")
(code-pdf-text "tarskiaot" "$S/https/www.dimap.ufrn.br/~jmarcos/papers/AoT-McKinsey_Tarski.pdf" -139)
;; (find-tarskiaotpage)
;; (find-tarskiaotpage (+ -139 141))
;; (find-tarskiaottext)
;; «tarskisclh» (to ".tarskisclh")
;; McKinsey/Tarski: Some Theorems About the Sentential Calculi of Lewis and Heyting (1948)
;; http://www.jstor.org/stable/2268135 .
;; (find-fline "~/books/__logic/" "mckinsey-tarski_1948.pdf")
;; (find-fline "~/books/__logic/")
(code-xpdf "tarskisclh" "~/books/__logic/mckinsey-tarski_1948.pdf")
(code-pdf-text "tarskisclh" "~/books/__logic/mckinsey-tarski_1948.pdf" 1)
;; (find-tarskisclhpage)
;; (find-tarskisclhtext)
;; (find-tarskisclhpage (+ 1 1) "1. The Lewis system and closure algebra")
;; (find-tarskisclhtext (+ 1 1) "1. The Lewis system and closure algebra")
;; «trafford» (to ".trafford")
;; (find-books "__logic/__logic.el" "trafford")
(code-pdf-page "trafford" "~/books/__logic/trafford__meaning_in_dialogue_an_interactive_approach_to_logic_and_reasoning.pdf")
(code-pdf-text "trafford" "~/books/__logic/trafford__meaning_in_dialogue_an_interactive_approach_to_logic_and_reasoning.pdf" 1)
;; (find-traffordpage)
;; (find-traffordpage 1 "Contents")
;; (find-traffordpage (+ 1 189) "Index")
;; (find-traffordtext "")
;; «troelstra» (to ".troelstra")
;; https://www.illc.uva.nl/NewsandEvents/News/Obituaries/Anne-Troelstra-1939-2019-/
;; «umezawa» (to ".umezawa")
;; (find-books "__logic/__logic.el" "umezawa")
(code-pdf-page "umezawa" "~/books/__logic/umezawa__on_logics_intermediate_between_intuitionistic_and_classical_predicate_logic.pdf")
(code-pdf-text "umezawa" "~/books/__logic/umezawa__on_logics_intermediate_between_intuitionistic_and_classical_predicate_logic.pdf" -139)
;; (find-umezawapage)
;; (find-umezawapage (+ -139 141) "Contents")
;; (find-umezawatext "")
;; «vaananen» (to ".vaananen")
;; (find-books "__logic/__logic.el" "vaananen")
(code-pdf-page "vaananenmg" "~/books/__logic/vaananen__models_and_games.pdf")
(code-pdf-text "vaananenmg" "~/books/__logic/vaananen__models_and_games.pdf" 1)
;; (find-vaananenmgpage)
;; (find-vaananenmgpage 9 "Contents")
;; (find-vaananenmgpage (+ 14 1) "1 Introduction")
;; (find-vaananenmgpage (+ 14 3) "2 Preliminaries and Notation")
;; (find-vaananenmgpage (+ 14 3) "2.1 Finite Sequences")
;; (find-vaananenmgpage (+ 14 5) "2.2 Equipollence")
;; (find-vaananenmgpage (+ 14 6) "2.3 Countable sets")
;; (find-vaananenmgpage (+ 14 7) "2.4 Ordinals")
;; (find-vaananenmgpage (+ 14 9) "2.5 Cardinals")
;; (find-vaananenmgpage (+ 14 10) "2.6 Axiom of Choice")
;; (find-vaananenmgpage (+ 14 11) "2.7 Historical Remarks and References")
;; (find-vaananenmgpage (+ 14 11) "Exercises")
;; (find-vaananenmgpage (+ 14 14) "3 Games")
;; (find-vaananenmgpage (+ 14 14) "3.1 Introduction")
;; (find-vaananenmgpage (+ 14 14) "3.2 Two-Person Games of Perfect Information")
;; (find-vaananenmgpage (+ 14 20) "3.3 The Mathematical Concept of Game")
;; (find-vaananenmgpage (+ 14 21) "3.4 Game Positions")
;; (find-vaananenmgpage (+ 14 24) "3.5 Infinite Games")
;; (find-vaananenmgpage (+ 14 28) "3.6 Historical Remarks and References")
;; (find-vaananenmgpage (+ 14 28) "Exercises")
;; (find-vaananenmgpage (+ 14 35) "4 Graphs")
;; (find-vaananenmgpage (+ 14 35) "4.1 Introduction")
;; (find-vaananenmgpage (+ 14 35) "4.2 First-Order Language of Graphs")
;; (find-vaananenmgpage (+ 14 38) "4.3 The Ehrenfeucht-Fraisse Game on Graphs")
;; (find-vaananenmgpage (+ 14 43) "4.4 Ehrenfeucht-Fraisse Games and Elementary Equivalence")
;; (find-vaananenmgpage (+ 14 48) "4.5 Historical Remarks and References")
;; (find-vaananenmgpage (+ 14 49) "Exercises")
;; (find-vaananenmgpage (+ 14 53) "5 Models")
;; (find-vaananenmgpage (+ 14 53) "5.1 Introduction")
;; (find-vaananenmgpage (+ 14 54) "5.2 Basic Concepts")
;; (find-vaananenmgpage (+ 14 62) "5.3 Substructures")
;; (find-vaananenmgpage (+ 14 63) "5.4 Back-and-Forth Sets")
;; (find-vaananenmgpage (+ 14 65) "5.5 The Ehrenfeucht-Fraisse Game")
;; (find-vaananenmgpage (+ 14 69) "5.6 Back-and-Forth Sequences")
;; (find-vaananenmgpage (+ 14 71) "5.7 Historical Remarks and References")
;; (find-vaananenmgpage (+ 14 71) "Exercises")
;; (find-vaananenmgpage (+ 14 79) "6 First-Order Logic")
;; (find-vaananenmgpage (+ 14 79) "6.1 Introduction")
;; (find-vaananenmgpage (+ 14 79) "6.2 Basic Concepts")
;; (find-vaananenmgpage (+ 14 81) "6.3 Characterizing Elementary Equivalence")
;; (find-vaananenmgpage (+ 14 85) "6.4 The Lowenheim-Skolem Theorem")
;; (find-vaananenmgpage (+ 14 93) "6.5 The Semantic Game")
;; (find-vaananenmgpage (+ 14 98) "6.6 The Model Existence Game")
;; (find-vaananenmgpage (+ 14 102) "6.7 Applications")
;; (find-vaananenmgpage (+ 14 107) "6.8 Interpolation")
;; (find-vaananenmgpage (+ 14 113) "6.9 Uncountable Vocabularies")
;; (find-vaananenmgpage (+ 14 119) "6.10 Ultraproducts")
;; (find-vaananenmgpage (+ 14 125) "6.11 Historical Remarks and References")
;; (find-vaananenmgpage (+ 14 126) "Exercises")
;; (find-vaananenmgpage (+ 14 139) "7 Infinitary Logic")
;; (find-vaananenmgpage (+ 14 139) "7.1 Introduction")
;; (find-vaananenmgpage (+ 14 139) "7.2 Preliminary Examples")
;; (find-vaananenmgpage (+ 14 144) "7.3 The Dynamic Ehrenfeucht-Fraisse Game")
;; (find-vaananenmgpage (+ 14 157) "7.4 Syntax and Semantics of Infinitary Logic")
;; (find-vaananenmgpage (+ 14 170) "7.5 Historical Remarks and References")
;; (find-vaananenmgpage (+ 14 171) "Exercises")
;; (find-vaananenmgpage (+ 14 176) "8 Model Theory of Infinitary Logic")
;; (find-vaananenmgpage (+ 14 176) "8.1 Introduction")
;; (find-vaananenmgpage (+ 14 176) "8.2 Lowenheim-Skolem Theorem for L")
;; (find-vaananenmgpage (+ 14 179) "8.3 Model Theory of L1")
;; (find-vaananenmgpage (+ 14 184) "8.4 Large Models")
;; (find-vaananenmgpage (+ 14 191) "8.5 Model Theory of L+")
;; (find-vaananenmgpage (+ 14 201) "8.6 Game Logic")
;; (find-vaananenmgpage (+ 14 222) "8.7 Historical Remarks and References")
;; (find-vaananenmgpage (+ 14 223) "Exercises")
;; (find-vaananenmgpage (+ 14 228) "9 Stronger Infinitary Logics")
;; (find-vaananenmgpage (+ 14 228) "9.1 Introduction")
;; (find-vaananenmgpage (+ 14 228) "9.2 Infinite Quantifier Logic")
;; (find-vaananenmgpage (+ 14 249) "9.3 The Transfinite Ehrenfeucht-Fraisse Game")
;; (find-vaananenmgpage (+ 14 254) "9.4 A Quasi-Order of Partially Ordered Sets")
;; (find-vaananenmgpage (+ 14 258) "9.5 The Transfinite Dynamic Ehrenfeucht-Fraisse Game")
;; (find-vaananenmgpage (+ 14 270) "9.6 Topology of Uncountable Models")
;; (find-vaananenmgpage (+ 14 275) "9.7 Historical Remarks and References")
;; (find-vaananenmgpage (+ 14 278) "Exercises")
;; (find-vaananenmgpage (+ 14 283) "10 Generalized Quantifiers")
;; (find-vaananenmgpage (+ 14 283) "10.1 Introduction")
;; (find-vaananenmgpage (+ 14 284) "10.2 Generalized Quantifiers")
;; (find-vaananenmgpage (+ 14 296) "10.3 The Ehrenfeucht-Fraisse Game of Q")
;; (find-vaananenmgpage (+ 14 307) "10.4 First-Order Logic with a Generalized Quantifier")
;; (find-vaananenmgpage (+ 14 312) "10.5 Ultraproducts and Generalized Quantifiers")
;; (find-vaananenmgpage (+ 14 314) "10.6 Axioms for Generalized Quantifiers")
;; (find-vaananenmgpage (+ 14 333) "10.7 The Cofinality Quantifier")
;; (find-vaananenmgpage (+ 14 342) "10.8 Historical Remarks and References")
;; (find-vaananenmgpage (+ 14 343) "Exercises")
;; (find-vaananenmgpage (+ 14 353) "References")
;; (find-vaananenmgpage (+ 14 362) "Index")
;; (find-vaananenmgtext "")
(code-pdf-page "vaananendl" "~/books/__logic/vaananen__dependence_logic_a_new_approach_to_independence_friendly_logic.pdf")
(code-pdf-text "vaananendl" "~/books/__logic/vaananen__dependence_logic_a_new_approach_to_independence_friendly_logic.pdf" 1)
;; (find-vaananendlpage)
;; (find-vaananendlpage 1 "Contents")
;; (find-vaananendlpage (+ 1 189) "Index")
;; (find-vaananendltext "")
;; «van_dalen» (to ".van_dalen")
;; (find-books "__logic/__logic.el" "van_dalen")
;; (find-LATEX "catsem-u.bib" "bib-VanDalen")
(code-pdf-page "vdls" "~/books/__logic/van_dalen__logic_and_structure.pdf")
(code-pdf-text "vdls" "~/books/__logic/van_dalen__logic_and_structure.pdf" 12)
;; (find-vdlspage)
;; (find-vdlspage 11 "Contents")
;; (find-vdlstext 11 "Contents")
;; (find-vdlspage (+ 12 1) "0 Introduction")
;; (find-vdlspage (+ 12 5) "1 Propositional Logic")
;; (find-vdlspage (+ 12 5) "1.1 Propositions and Connectives")
;; (find-vdlspage (+ 12 15) "1.2 Semantics")
;; (find-vdlspage (+ 12 21) "1.3 Some Properties of Propositional logic")
;; (find-vdlspage (+ 12 30) "1.4 Natural Deduction")
;; (find-vdlspage (+ 12 36) "turnstile")
;; (find-vdlstext (+ 12 36) "turnstile")
;; (find-vdlspage (+ 12 40) "1.5 Completeness")
;; (find-vdlspage (+ 12 49) "1.6 The Missing Connectives")
;; (find-vdlspage (+ 12 57) "2 Predicate Logic")
;; (find-vdlspage (+ 12 57) "2.1 Quantifiers")
;; (find-vdlspage (+ 12 58) "2.2 Structures")
;; (find-vdlspage (+ 12 60) "2.3 The Language of a Similarity Type")
;; (find-vdlspage (+ 12 68) "2.4 Semantics")
;; (find-vdlspage (+ 12 73) "2.5 Simple Properties of Predicate Logic")
;; (find-vdlspage (+ 12 81) "2.6 Identity")
;; (find-vdlspage (+ 12 83) "2.7 Examples")
;; (find-vdlspage (+ 12 91) "2.8 Natural Deduction")
;; (find-vdlspage (+ 12 96) "2.9 Adding the Existential Quantifier")
;; (find-vdlspage (+ 12 99) "2.10 Natural Deduction and Identity")
;; (find-vdlspage (+ 12 103) "3 Completeness and Applications")
;; (find-vdlspage (+ 12 103) "3.1 The Completeness Theorem")
;; (find-vdlspage (+ 12 111) "3.2 Compactness and Skolem-Lowenheim")
;; (find-vdlspage (+ 12 118) "3.3 Some Model Theory")
;; (find-vdlspage (+ 12 135) "3.4 Skolem Functions or How to Enrich Your Language")
;; (find-vdlspage (+ 12 143) "4 Second Order Logic")
;; (find-vdlspage (+ 12 153) "5 Intuitionistic Logic")
;; (find-vdlspage (+ 12 153) "5.1 Constructive Reasoning")
;; (find-vdlspage (+ 12 156) "5.2 Intuitionistic Propositional and Predicate Logic")
;; (find-vdlspage (+ 12 162) "5.3 Kripke Semantics")
;; (find-vdlspage (+ 12 165) "refute classically true formulas")
;; (find-vdlstext (+ 12 165) "refute classically true formulas")
;; (find-vdlspage (+ 12 173) "5.4 Some Model Theory")
;; (find-vdlspage (+ 12 180) "all non-zero elements are invertible")
;; (find-vdlstext (+ 12 180) "all non-zero elements are invertible")
;; (find-vdlspage (+ 12 185) "Rieger-Nishimura")
;; (find-vdlstext (+ 12 185) "Rieger-Nishimura")
;; (find-vdlspage (+ 12 187) "6 Normalisation")
;; (find-vdlspage (+ 12 187) "6.1 Cuts")
;; (find-vdlspage (+ 12 192) "6.2 Normalization for Classical Logic")
;; (find-vdlspage (+ 12 198) "6.3 Normalization for Intuitionistic Logic")
;; (find-vdlspage (+ 12 209) "7 Godel's theorem")
;; (find-vdlspage (+ 12 209) "7.1 Primitive recursive functions")
;; (find-vdlspage (+ 12 218) "7.2 Partial Recursive Functions")
;; (find-vdlspage (+ 12 230) "7.3 Recursively enumerable sets")
;; (find-vdlspage (+ 12 236) "7.4 Some arithmetic")
;; (find-vdlspage (+ 12 242) "7.5 Representability")
;; (find-vdlspage (+ 12 246) "7.6 Derivability")
;; (find-vdlspage (+ 12 251) "7.7 Incompleteness")
;; (find-vdlspage (+ 12 259) "Index")
;; (find-vdlstext (+ 12 259) "Index")
;; (find-vdlstext "")
;; «vandenberg-neves» (to ".vandenberg-neves")
;; «nsa» (to ".nsa")
;; http://gigapedia.org/items/89038/the-strength-of-nonstandard-analysis
(code-djvu "strengthofnsa" "~/books/__logic/van_den_berg_neves__the_strength_of_NSA.djvu")
;; (find-strengthofnsapage 12 "Contents")
;; (find-strengthofnsapage (+ 18 27) "Nelson")
;; (find-strengthofnsapage (+ 18 33) "Péraire")
;; (find-strengthofnsapage (+ 18 369) "24. Calculus with infinitesimals" "Keith D. Stroyan")
;; «vandoulakis» (to ".vandoulakis")
;; (find-books "__logic/__logic.el" "vandoulakis")
;; https://mail.google.com/mail/ca/u/0/#inbox/FMfcgxwHMjwVqdvjbjSlTcPjvJTcnGbW?projector=1&messagePartId=0.1
(code-pdf-page "vandoulakisinst2020" "~/books/__logic/kiouvrekis_stefaneas_vandoulakis__the_transformations_of_the_square_of_opposition.pdf")
(code-pdf-text "vandoulakisinst2020" "~/books/__logic/kiouvrekis_stefaneas_vandoulakis__the_transformations_of_the_square_of_opposition.pdf" 1)
;; (find-vandoulakisinst2020page)
;; (find-vandoulakisinst2020page 1 "Contents")
;; (find-vandoulakisinst2020page (+ 1 189) "Index")
;; (find-vandoulakisinst2020text "")
;; «wiedijk» (to ".wiedijk")
;; (find-books "__logic/__logic.el" "wiedijk")
;; (find-books "__comp/__comp.el" "sussman-wisdom")
;; Freek Wiedijk: "The Mathematical Vernacular"
;; https://www.cs.ru.nl/~freek/
;; https://www.cs.ru.nl/~freek/notes/
;; https://www.cs.ru.nl/~freek/notes/mv.pdf
;; (find-fline "$S/https/www.cs.ru.nl/~freek/notes/")
(code-pdf-page "vernacular" "$S/https/www.cs.ru.nl/~freek/notes/mv.pdf")
(code-pdf-text "vernacular" "$S/https/www.cs.ru.nl/~freek/notes/mv.pdf")
;; (find-vernacularpage)
;; (find-vernaculartext)
;;
;; Formalizing Elementary Analysis Rigorously:
;; https://www.cs.ru.nl/~freek/notes/oc2004.pdf
(code-pdf-page "wiedijkfear" "$S/https/www.cs.ru.nl/~freek/notes/oc2004.pdf")
(code-pdf-text "wiedijkfear" "$S/https/www.cs.ru.nl/~freek/notes/oc2004.pdf")
;; (find-wiedijkfearpage)
;; (find-wiedijkfeartext)
;; «wiedijk-dbf» (to ".wiedijk-dbf")
;; (find-books "__logic/__logic.el" "wiedijk-dbf")
;; https://www.cs.ru.nl/~freek/notes/index.html
;; https://www.cs.ru.nl/~freek/factor/factor.pdf
(code-pdf-page "wiedijkdbf" "$S/https/www.cs.ru.nl/~freek/factor/factor.pdf")
(code-pdf-text "wiedijkdbf" "$S/https/www.cs.ru.nl/~freek/factor/factor.pdf")
;; (find-wiedijkdbfpage)
;; (find-wiedijkdbftext)
;; «velleman» (to ".velleman")
;; (find-books "__logic/__logic.el" "velleman")
(code-pdf-page "velleman" "~/books/__logic/velleman__how_to_prove_it_2nd_ed.pdf")
(code-pdf-text "velleman" "~/books/__logic/velleman__how_to_prove_it_2nd_ed.pdf" 1)
;; (find-vellemanpage)
;; (find-vellemanpage 1 "Contents")
;; (find-vellemanpage (+ 1 189) "Index")
;; (find-vellemantext "")
;; «victor-nascimento» (to ".victor-nascimento")
;; (find-books "__logic/__logic.el" "victor-nascimento")
;; (find-books "__logic/__logic.el" "bierman-depaiva")
;; (find-books "__logic/__logic.el" "victor-nascimento")
(code-pdf-page "victorphd" "~/books/__logic/victor_nascimento__foundational_studies_in_proof_theoretic_semantics.pdf")
(code-pdf-text "victorphd" "~/books/__logic/victor_nascimento__foundational_studies_in_proof_theoretic_semantics.pdf" 1)
;; (find-victorphdpage)
;; (find-victorphdpage 1 "Contents")
;; (find-victorphdpage (+ 1 189) "Index")
;; (find-victorphdtext "")
(code-pdf-page "victornpipss" "~/books/__logic/victor_nascimento__normalization_proof_in_prawitz_style_systems.pdf")
(code-pdf-text "victornpipss" "~/books/__logic/victor_nascimento__normalization_proof_in_prawitz_style_systems.pdf" 1)
;; (find-victornpipsspage)
;; (find-victornpipsspage 1 "Contents")
;; (find-victornpipsspage (+ 1 189) "Index")
;; (find-victornpipsstext "")
(code-pdf-page "victorsrmnd" "~/books/__logic/victor_nascimento__simplified_rules_for_modal_natural_deduction.pdf")
(code-pdf-text "victorsrmnd" "~/books/__logic/victor_nascimento__simplified_rules_for_modal_natural_deduction.pdf" 1)
;; (find-victorsrmndpage)
;; (find-victorsrmndpage 3 "Consider, for example, the following derivation")
;; (find-victorsrmndtext 3 "Consider, for example, the following derivation")
;; (find-victorsrmndpage 15 "semi-derivation")
;; (find-victorsrmndtext 15 "semi-derivation")
;; (find-victorsrmndpage 20 "References")
;; (find-victorsrmndpage (+ 1 189) "Index")
;; (find-victorsrmndtext "")
(code-pdf-page "victorniS4" "~/books/__logic/victor_nascimento__normalization_for_intuitionistic_S4.pdf")
(code-pdf-text "victorniS4" "~/books/__logic/victor_nascimento__normalization_for_intuitionistic_S4.pdf" 1)
;; (find-victorniS4page)
;; (find-victorniS4page 1 "Contents")
;; (find-victorniS4page (+ 1 189) "Index")
;; (find-victorniS4page 2)
;; (find-victorniS4text "")
(code-pdf-page "victordnll" "~/books/__logic/victor_nascimento__deducao_natural_para_logica_Linear.pdf")
(code-pdf-text "victordnll" "~/books/__logic/victor_nascimento__deducao_natural_para_logica_Linear.pdf" 1)
;; (find-victordnllpage)
;; (find-victordnllpage 1 "Contents")
;; (find-victordnllpage (+ 1 189) "Index")
;; (find-victordnlltext "")
(code-pdf-page "victordnc" "~/books/__logic/victor_nascimento__deducao_natural_para_categorias.pdf")
(code-pdf-text "victordnc" "~/books/__logic/victor_nascimento__deducao_natural_para_categorias.pdf" 1)
;; (find-victordncpage)
;; (find-victordncpage 1 "Contents")
;; (find-victordncpage (+ 1 189) "Index")
;; (find-victordnctext "")
(code-pdf-page "victornrm" "~/books/__logic/victor_nascimento__novas_regras_modais.pdf")
(code-pdf-text "victornrm" "~/books/__logic/victor_nascimento__novas_regras_modais.pdf" 1)
;; (find-victornrmpage)
;; (find-victornrmpage 1 "Contents")
;; (find-victornrmpage (+ 1 189) "Index")
;; (find-victornrmtext "")
;; «vonplato» (to ".vonplato")
;; (find-books "__logic/__logic.el" "vonplato")
(code-pdf-page "vonplatoelr" "~/books/__logic/vonplato__elements_of_logical_reasoning.pdf")
(code-pdf-text "vonplatoelr" "~/books/__logic/vonplato__elements_of_logical_reasoning.pdf" 12)
;; (find-vonplatoelrpage)
;; (find-vonplatoelrpage 7 "Contents")
;; (find-vonplatoelrpage (+ 12 162) "transparent rule-based")
;; (find-vonplatoelrtext (+ 12 162) "transparent rule-based")
;; (find-vonplatoelrpage (+ 12 162) "zero-premiss rule")
;; (find-vonplatoelrtext (+ 12 162) "zero-premiss rule")
;; (find-vonplatoelrpage (+ 12 262) "Index of subjects")
;; (find-vonplatoelrtext "")
;; https://onlinelibrary.wiley.com/doi/abs/10.1002/malq.200310047
(code-pdf-page "vonplatotrandsc" "~/books/__logic/vonplato__translations_from_natural_deduction_to_sequent_calculus.pdf")
(code-pdf-text "vonplatotrandsc" "~/books/__logic/vonplato__translations_from_natural_deduction_to_sequent_calculus.pdf" -434)
;; (find-vonplatotrandscpage)
;; (find-vonplatotrandscpage 1 "Contents")
;; (find-vonplatotrandscpage (+ 1 189) "Index")
;; (find-vonplatotrandsctext "")
;; «wickerson-dodds-parkinson» (to ".wickerson-dodds-parkinson")
;; Wickerson/Dodds/Parkinson: "Ribbon Proofs for Separation Logic"
;; https://johnwickerson.github.io/papers/ribbons_esop13.pdf
;; (find-fline "$S/https/johnwickerson.github.io/papers/")
(code-pdf-page "ribbonproofs" "$S/https/johnwickerson.github.io/papers/ribbons_esop13.pdf")
(code-pdf-text "ribbonproofs" "$S/https/johnwickerson.github.io/papers/ribbons_esop13.pdf")
;; (find-ribbonproofspage)
;; (find-ribbonproofstext)
;; «wilander» (to ".wilander")
;; (find-books "__logic/__logic.el" "wilander")
;; [Wil10] Olov Wilander. Setoids and universes. Mathematical Structures
;; in Computer Science, 20(4):563-576, 2010.
;; https://doi.org/10.1017/S0960129510000071
(code-pdf-page "wilander" "~/books/__logic/wilander__setoids_and_universes.pdf")
(code-pdf-text "wilander" "~/books/__logic/wilander__setoids_and_universes.pdf" 1)
;; (find-wilanderpage)
;; (find-wilanderpage (+ -561 562) "")
;; (find-wilanderpage (+ -561 564) "")
;; (find-wilandertext "")
;; «games» (to ".games")
;; http://gigapedia.com/items/255472/games--unifying-logic--language--and-philosophy--logic--epistemology--and-the-unity-of-science-
(code-xpdf "gullap" "~/books/__logic/majer_pietarinen_eds__games_unifying_logic_language_and_philosophy.pdf")
;; (find-gullappage 6 "Contents")
;; (find-gullappage (+ 13 373) "Subject Index")
;; «iapt-buffalo68» (to ".iapt-buffalo68")
;; (find-books "__logic/__logic.el" "iapt-buffalo68")
;; Kino, Myhill, Vesley, eds: "Intuitionism and Proof Theory -
;; Proceedings of the Summer Conference at Buffalo 1968"
(code-pdf-page "iaptbuffalo68" "~/books/__logic/kino_myhill_vesley__intuitionism_and_proof_theory_buffalo_1968.pdf")
(code-pdf-text "iaptbuffalo68" "~/books/__logic/kino_myhill_vesley__intuitionism_and_proof_theory_buffalo_1968.pdf" 1)
;; (find-iaptbuffalo68page)
;; (find-iaptbuffalo68page 1 "Contents")
;; (find-iaptbuffalo68page (+ 4 1) "A. New Directions")
;; (find-iaptbuffalo68page (+ 3 3) "The Ultra-Intuitionistic Criticism...")
;; (find-iaptbuffalo68page (+ 3 46) "Computable Analysis...")
;; (find-iaptbuffalo68page (+ 2 53) "Mathematics as a Numerical Language (Bishop)")
;; (find-iaptbuffalo68page (+ 1 73) "On the notion of randomness (Martin-Lof)")
;; (find-iaptbuffalo68page (+ 1 79) "Abstract Quantification Theory (Smullyan)")
;; (find-iaptbuffalo68page (+ 0 93) "B. Traditional Intuitionism")
;; (find-iaptbuffalo68page (+ -1 95) "(Heyting)")
;; (find-iaptbuffalo68page (+ -1 101) "(Goodman)")
;; (find-iaptbuffalo68page (+ -1 121) "(Kreisel)")
;; (find-iaptbuffalo68page (+ -1 151) "Species (Myhill)")
;; (find-iaptbuffalo68page (+ -1 163) "(Van Dalen, Troelstra)")
;; (find-iaptbuffalo68page (+ -1 187) "(Rootsevalaar)")
;; (find-iaptbuffalo68page (+ -1 197) "(Vesley)")
;; (find-iaptbuffalo68page (+ -2 209) "C. Classical Interpretations of Intuitionism")
;; (find-iaptbuffalo68page (+ -3 211) "(De Jongh)")
;; (find-iaptbuffalo68page (+ -4 219) "(Fitting)")
;; (find-iaptbuffalo68page (+ -4 227) "(Lauchli)")
;; (find-iaptbuffalo68page (+ -4 235) "(Dana Scott)")
;; (find-iaptbuffalo68page (+ -5 257) "D. Proof Theory")
;; (find-iaptbuffalo68page (+ -6 259) "(Prawitz)")
;; (find-iaptbuffalo68page (+ -7 271) "(Scarpellini)")
;; (find-iaptbuffalo68page (+ -8 287) "E. Proof-Theoretic Ordinals")
;; (find-iaptbuffalo68page (+ -9 289) "(Feferman)")
;; (find-iaptbuffalo68page (+ -10 303) "(Feferman)")
;; (find-iaptbuffalo68page (+ -10 327) "(Gerber)")
;; (find-iaptbuffalo68page (+ -10 339) "(Isles)")
;; (find-iaptbuffalo68page (+ -11 363) "(Kino)")
;; (find-iaptbuffalo68page (+ -11 377) "(Takeuti)")
;; (find-iaptbuffalo68page (+ -12 407) "F. Proof Theory")
;; (find-iaptbuffalo68page (+ -13 409) "(Bernays)")
;; (find-iaptbuffalo68page (+ -14 419) "(Dreben, Denton)")
;; (find-iaptbuffalo68page (+ -15 435) "(Friedman)")
;; (find-iaptbuffalo68page (+ -15 443) "(Howard)")
;; (find-iaptbuffalo68page (+ -15 459) "(Parsons)")
;; (find-iaptbuffalo68page (+ -16 475) "(Tait)")
;; (find-iaptbuffalo68page (+ -16 489) "(Kreisel)")
;; (find-iaptbuffalo68text "")
;; «logic-and-alg-spec» (to ".logic-and-alg-spec")
;; (find-books "__logic/__logic.el" "logic-and-alg-spec")
;; (find-books "__comp/__comp.el" "milner")
(code-pdf-page "laaspec" "~/books/__logic/bauer_brauer_schwichtenberg__logic_and_algebra_of_specification.pdf")
(code-pdf-text "laaspec" "~/books/__logic/bauer_brauer_schwichtenberg__logic_and_algebra_of_specification.pdf" 1)
;; (find-laaspecpage)
;; (find-laaspecpage 6 "Contents")
;; (find-laaspecpage (+ 5 203) "The polyadic pi-calculus: a tutorial" "Robin Milner")
;; (find-laaspectext "")
;; «tableaux» (to ".tableaux")
;; http://gigapedia.com/items/68358/handbook-of-tableau-methods
;; http://www.dcs.kcl.ac.uk/research/groups/gllc/publications/handbooks.html
(code-xpdf "tableaumethods" "~/books/__logic/dagostino_gabbay_eds__handbook_of_tableau_methods.pdf")
;; (find-tableaumethodspage 4 "Contents")
;; (find-tableaumethodspage (+ 7 1) "Melvin Fitting - Introduction")
;; (find-tableaumethodspage (+ 7 125) "First-order tableau methods")
;; (find-tableaumethodspage (+ 7 255) "Tableaux for Intuitionistic Logics")
;; (find-tableaumethodspage (+ 7 657) "Index")
;; «tapsoft93» (to ".tapsoft93")
;; (find-books "__logic/__logic.el" "tapsoft93")
(code-pdf-page "tapsoft93" "~/books/__logic/tapsoft93.pdf")
(code-pdf-text "tapsoft93" "~/books/__logic/tapsoft93.pdf" 1)
;; (find-tapsoft93page)
;; (find-tapsoft93page 7 "Contents")
;; (find-tapsoft93page (+ 10 559) "On the Ehrenfeucht-Fraisse Game in Theoretical Computer Science")
;; (find-tapsoft93page (+ 1 189) "Index")
;; (find-tapsoft93text "")
;; «typetheory» (to ".typetheory")
;; (find-books "__logic/__logic.el" "typetheory")
;; (find-angg ".emacs.papers" "kamareddine")
;; (find-LATEX "catsem.bib" "bib-Kamareddine")
(code-xpdf "mpott" "~/books/__logic/kamareddine_laan_nederpelt__a_modern_perspective_on_type_theory.pdf")
(code-pdftotext "mpott" "~/books/__logic/kamareddine_laan_nederpelt__a_modern_perspective_on_type_theory.pdf" 16)
;; (find-mpottpage 5 "Contents")
;; (find-mpotttext 5 "Contents")
;; (find-mpottpage (+ 10 349) "Subject index")
;; (find-mpottpage (+ 12 231) "8. Pure Type Systems with definitions")
;; (find-mpotttext "Chapter 8\n\nPure Type Systems with\ndefinitions")
;; (find-mpottpage (+ 10 243) "9 The Barendregt cube with parameters")
;; (find-mpotttext "Chapter 9\n\nThe Barendregt cube with\nparameters")
;; (find-mpottpage (+ 10 255) "10 Pure Type Systems with parameters and definitions")
;; (find-mpotttext "Chapter 10\n\nPure Type Systems with\nparameters and definitions")
;; (find-mpotttext )
;; (find-mpottpage (+ 16 1) "0 Introduction")
;; (find-mpottpage (+ 16 1) "Avoiding the paradox in set theory")
;; (find-mpottpage (+ 16 2) "foundation axiom")
;; (find-mpottpage (+ 16 3) "is said to be stratified if")
;; (find-mpotttext (+ 16 3) "is said to be stratified if")
;; (find-mpottpage (+ 16 4) "Avoiding the paradox in type theory")
;; (find-mpottpage (+ 16 5) "The approach")
;; (find-mpottpage (+ 16 7) "I The Evolution of Type Theory until the 1940s")
;; (find-mpottpage (+ 14 9) "1 Prehistory")
;; (find-mpottpage (+ 14 10) "1a Paradox threats")
;; (find-mpottpage (+ 14 11) "1b Paradox threats in formal systems")
;; (find-mpottpage (+ 14 12) "1b1 Functions and their course of values")
;; (find-mpottpage (+ 14 15) "1b2 The Russell Paradox in Grundgesetze")
;; (find-mpottpage (+ 14 16) "1b3 How wrong was Frege?")
;; (find-mpottpage (+ 14 18) "1b4 The importance of Russell's Paradox")
;; (find-mpottpage (+ 14 19) "2 Type theory in Principia Mathematica")
;; (find-mpottpage (+ 14 22) "2a Principia's propositional functions")
;; (find-mpottpage (+ 14 22) "2a1 Definition")
;; (find-mpottpage (+ 14 24) "2a2 Principia's propositional functions as")
;; (find-mpottpage (+ 14 26) "2a3 Principia's pfs and their translation in")
;; (find-mpottpage (+ 14 29) "2a4 Principia's related notions")
;; (find-mpottpage (+ 14 31) "2a5 Principia's substitution")
;; (find-mpottpage (+ 14 35) "2b The Ramified Theory of Types RTT")
;; (find-mpottpage (+ 14 35) "2b1 Types")
;; (find-mpottpage (+ 14 40) "2b2 Formalisation of the Ramified Theory of Types")
;; (find-mpottpage (+ 14 43) "2b3 Discussion and examples")
;; (find-mpottpage (+ 14 49) "2c Properties of RTT")
;; (find-mpottpage (+ 14 49) "2c1 Types and free variables")
;; (find-mpottpage (+ 14 51) "2c2 Strong normalisation")
;; (find-mpottpage (+ 14 58) "2c3 Subterm property")
;; (find-mpottpage (+ 14 59) "2d Legal propositional functions")
;; (find-mpottpage (+ 14 65) "Conclusions")
;; (find-mpottpage (+ 14 69) "3 Deramification")
;; (find-mpottpage (+ 14 70) "3a History of the deramification")
;; (find-mpottpage (+ 14 70) "3a1 The problematic character of RTT")
;; (find-mpottpage (+ 14 72) "3a2 The Axiom of Reducibility")
;; (find-mpottpage (+ 14 74) "3a3 Deramification")
;; (find-mpottpage (+ 14 76) "3b The Simple Theory of Types STT")
;; (find-mpottpage (+ 14 76) "3b1 Constructing the Simple Theory of Types from RTT")
;; (find-mpottpage (+ 14 77) "3b2 Church's simply typed")
;; (find-mpottpage (+ 14 79) "3b3 Comparison of RTT with")
;; (find-mpottpage (+ 14 79) "3b4 Comparison of STT with")
;; (find-mpottpage (+ 14 81) "3c Are orders to be blamed?")
;; (find-mpottpage (+ 14 82) "3c1 Kripke's Theory of Truth KTT")
;; (find-mpottpage (+ 14 86) "3c2 RTT in KTT")
;; (find-mpottpage (+ 14 99) "3c3 Orders and types")
;; (find-mpottpage (+ 14 100) "Conclusions")
;; (find-mpottpage (+ 14 103) "II Propositions as Types, Pure Type Systems, AUTOMATH")
;; (find-mpottpage (+ 12 105) "4 Propositions as Types and Pure Type Systems")
;; (find-mpottpage (+ 12 106) "4a Propositions as Types and Proofs as Terms (PAT)")
;; (find-mpottpage (+ 12 106) "4a1 Intuitionistic logic")
;; (find-mpottpage (+ 12 107) "4a2 The discovery of PAT: Curry")
;; (find-mpottpage (+ 12 110) "4a3 The discovery of PAT: Howard")
;; (find-mpottpage (+ 12 111) "4a4 The discovery of PAT: de Bruijn")
;; (find-mpottpage (+ 12 112) "4b Lambda calculus")
;; (find-mpottpage (+ 12 116) "4c Pure Type Systems")
;; (find-mpottpage (+ 12 118) "4c1 The Barendregt cube")
;; (find-mpottpage (+ 12 121) "4c2 Metaproperties of PTSs")
;; (find-mpottpage (+ 12 125) "5 The pre-PAT RTT and STT in PAT-style")
;; (find-mpottpage (+ 12 125) "5a RTT in PAT style")
;; (find-mpottpage (+ 12 126) "5a1 An introduction to lambda RTT")
;; (find-mpottpage (+ 12 132) "5a2 The system")
;; (find-mpottpage (+ 12 136) "5a3 Meta-properties of lambda RTT")
;; (find-mpottpage (+ 12 139) "5a4 Interpreting RTT in")
;; (find-mpottpage (+ 12 144) "5a5 Logic in RTT and")
;; (find-mpottpage (+ 12 146) "5a6 Various implementations of PAT")
;; (find-mpottpage (+ 12 150) "5b STT in PAT style")
;; (find-mpottpage (+ 12 151) "Conclusions")
;; (find-mpottpage (+ 12 153) "6 A Correspondence between RTT and the system Nuprl")
;; (find-mpottpage (+ 12 154) "6a On the role of orders")
;; (find-mpottpage (+ 12 156) "6b The Nuprl type system")
;; (find-mpottpage (+ 12 157) "6b1 A fragment of Nuprl in PTS-style")
;; (find-mpottpage (+ 12 162) "6b2 Orders in Nuprl")
;; (find-mpottpage (+ 12 165) "6b3 Evaluating the order of a Nuprl term")
;; (find-mpottpage (+ 12 168) "6c RTT in Nuprl")
;; (find-mpottpage (+ 12 168) "6c1 Ramified Types in Nuprl")
;; (find-mpottpage (+ 12 171) "6c2 Propositional Functions of RTT in Nuprl")
;; (find-mpottpage (+ 12 173) "Conclusions")
;; (find-mpottpage (+ 12 179) "7 Automath")
;; (find-mpottpage (+ 12 182) "7a Description of AUTOMATH")
;; (find-mpottpage (+ 12 182) "7a1 Books, lines and expressions")
;; (find-mpottpage (+ 12 189) "7a2 Correct books")
;; (find-mpottpage (+ 12 191) "7a3 Definitional equality")
;; (find-mpottpage (+ 12 193) "7a4 Some elementary properties")
;; (find-mpottpage (+ 12 194) "7b From AUT-68 towards a PTS")
;; (find-mpottpage (+ 12 195) "7b1 The choice of correct formation ... parameter types")
;; (find-mpottpage (+ 12 198) "7b2 The different treatment of constants and variables")
;; (find-mpottpage (+ 12 198) "7b3 The definition system and the translation using §")
;; (find-mpottpage (+ 12 200) "7c Lambda68")
;; (find-mpottpage (+ 12 200) "7c1 Definition and elementary properties")
;; (find-mpottpage (+ 12 206) "7c2 Reduction and conversion")
;; (find-mpottpage (+ 12 212) "7c3 Subject reduction")
;; (find-mpottpage (+ 12 216) "7c4 Strong normalisation")
;; (find-mpottpage (+ 12 220) "7c5 The formal relation between AUT-68 and")
;; (find-mpottpage (+ 12 223) "7d More Suitable Pure Type Systems for AUTOMATH")
;; (find-mpottpage (+ 12 224) "7d1 with parameters, and")
;; (find-mpottpage (+ 12 225) "7d2 AUT-QE")
;; (find-mpottpage (+ 12 227) "7d3")
;; (find-mpottpage (+ 12 229) "Conclusions")
;; (find-mpottpage (+ 12 231) "III Extensions of Pure Type Systems")
;; (find-mpottpage (+ 10 233) "8 Pure Type Systems with definitions")
;; (find-mpottpage (+ 10 234) "8a Definitions in contexts")
;; (find-mpottpage (+ 10 237) "8a1 Comparison with the definitions of AUTOMATH")
;; (find-mpottpage (+ 10 238) "8b Definitions in the terms and the contexts")
;; (find-mpottpage (+ 10 238) "8b1 Comparison with the definitions of AUTOMATH")
;; (find-mpottpage (+ 10 240) "Conclusions")
;; (find-mpottpage (+ 10 243) "9 The Barendregt cube with parameters")
;; (find-mpottpage (+ 10 244) "9a On parameters in the Barendregt cube")
;; (find-mpottpage (+ 10 250) "9b The Barendregt cube refined with parameters")
;; (find-mpottpage (+ 10 253) "Conclusions")
;; (find-mpottpage (+ 10 255) "10 Pure Type Systems with parameters and definitions")
;; (find-mpottpage (+ 10 256) "10a Parametric constants and definitions")
;; (find-mpottpage (+ 10 270) "10b Properties of terms")
;; (find-mpottpage (+ 10 270) "10b1 Basic properties")
;; (find-mpottpage (+ 10 273) "10b2 Church-Rosser for")
;; (find-mpottpage (+ 10 278) "10b3 Strong normalisation for")
;; (find-mpottpage (+ 10 281) "10c Properties of legal terms")
;; (find-mpottpage (+ 10 290) "10d Restrictive use of parameters")
;; (find-mpottpage (+ 10 292) "10d1 with restricted parameters")
;; (find-mpottpage (+ 10 294) "10d2 Imitating parameters by")
;; (find-mpottpage (+ 10 297) "10d3 Refined Barendregt cubes")
;; (find-mpottpage (+ 10 298) "10e Systems in the refined Barendregt cube")
;; (find-mpottpage (+ 10 299) "10e1 ML")
;; (find-mpottpage (+ 10 299) "10e2 LF")
;; (find-mpottpage (+ 10 300) "10e3 and AUT-68")
;; (find-mpottpage (+ 10 301) "10e4 and AUT-QE")
;; (find-mpottpage (+ 10 302) "10e5 PAL")
;; (find-mpottpage (+ 10 303) "10f First-order predicate logic")
;; (find-mpottpage (+ 10 307) "Conclusions: Yet another extension of PTSs?")
;; (find-mpottpage (+ 10 307) "Practical motivation")
;; (find-mpottpage (+ 10 308) "The heart of type theory")
;; (find-mpottpage (+ 10 310) "Future work")
;; (find-mpottpage (+ 10 311) "A Type systems in this book")
;; (find-mpottpage (+ 10 311) "Aa Pure Type Systems")
;; (find-mpottpage (+ 10 312) "Ab The Barendregt cube")
;; (find-mpottpage (+ 10 314) "Ac The Ramified Theory of Types")
;; (find-mpottpage (+ 10 314) "Ac1 RTT")
;; (find-mpottpage (+ 10 317) "Ac2")
;; (find-mpottpage (+ 10 318) "Ad The Simple Theory of Types")
;; (find-mpottpage (+ 10 318) "Ad1 STT")
;; (find-mpottpage (+ 10 320) "Ad2")
;; (find-mpottpage (+ 10 321) "Ae Church's simply typed")
;; (find-mpottpage (+ 10 322) "Af A fragment of Nuprl in PTS-style")
;; (find-mpottpage (+ 10 324) "Ag A UTOMATH")
;; (find-mpottpage (+ 10 324) "Ag1 AUT-68")
;; (find-mpottpage (+ 10 326) "Ag2")
;; (find-mpottpage (+ 10 328) "Ah Pure Type Systems with definitions")
;; (find-mpottpage (+ 10 328) "Ah1 PTSs with definitions in contexts")
;; (find-mpottpage (+ 10 330) "Ah2 PTSs with definitions in the terms and the contexts")
;; (find-mpottpage (+ 10 332) "Ai Pure Type Systems with parametric constants")
;; (find-mpottpage (+ 10 333) "Aj A and its subsystems")
;; (find-mpottpage (+ 10 333) "Aj1 PTSs with parameters and definitions")
;; (find-mpottpage (+ 10 335) "Aj2 PTSs with restricted parameters and definitions")
;; (find-mpottpage (+ 10 337) "Bibliography")
;; (find-mpottpage (+ 10 349) "Subject Index")
;; (find-mpottpage (+ 10 355) "Name Index")
;; (find-mpottpage (+ 10 357) "List of Figures")
;; http://gigapedia.com/items/120386/domains-and-lambda-calculi--cambridge-tracts-in-theoretical-computer-science-
(code-xpdf "amadiocurien" "~/books/__logic/amadio_curien__domains_and_lambda_calculi.pdf")
(code-pdftotext "amadiocurien" "~/books/__logic/amadio_curien__domains_and_lambda_calculi.pdf" 2)
;; (find-amadiocurienpage 3 "Contents")
;; (find-amadiocurienpage (+ 2 13) "Chapter 1")
;; (find-amadiocurientext "")
;; (find-amadiocurienpage (+ 2 13) "1 Continuity and Computability")
;; (find-amadiocurientext (+ 2 13) "1 Continuity and Computability")
;; (find-amadiocurienpage (+ 2 35) "2 Syntactic Theory of the -calculus")
;; (find-amadiocurientext (+ 2 35) "2 Syntactic Theory of the -calculus")
;; (find-amadiocurienpage (+ 2 57) "3 D1 Models and Intersection Types")
;; (find-amadiocurientext (+ 2 57) "3 D1 Models and Intersection Types")
;; (find-amadiocurienpage (+ 2 87) "4 Interpretation of -Calculi in CCC's")
;; (find-amadiocurientext (+ 2 87) "4 Interpretation of -Calculi in CCC's")
;; (find-amadiocurienpage (+ 2 123) "5 CCC's of Algebraic Dcpo's")
;; (find-amadiocurientext (+ 2 123) "5 CCC's of Algebraic Dcpo's")
;; (find-amadiocurienpage (+ 2 145) "6 The Language PCF")
;; (find-amadiocurientext (+ 2 145) "6 The Language PCF")
;; (find-amadiocurienpage (+ 2 167) "7 Domain Equations")
;; (find-amadiocurientext (+ 2 167) "7 Domain Equations")
;; (find-amadiocurienpage (+ 2 191) "8 Values and Computations")
;; (find-amadiocurientext (+ 2 191) "8 Values and Computations")
;; (find-amadiocurienpage (+ 2 225) "9 Powerdomains")
;; (find-amadiocurientext (+ 2 225) "9 Powerdomains")
;; (find-amadiocurienpage (+ 2 241) "10 Stone Duality")
;; (find-amadiocurientext (+ 2 241) "10 Stone Duality")
;; (find-amadiocurienpage (+ 2 267) "11 Dependent and Second Order Types")
;; (find-amadiocurientext (+ 2 267) "11 Dependent and Second Order Types")
;; (find-amadiocurienpage (+ 2 299) "12 Stability")
;; (find-amadiocurientext (+ 2 299) "12 Stability")
;; (find-amadiocurienpage (+ 2 335) "13 Towards Linear Logic")
;; (find-amadiocurientext (+ 2 335) "13 Towards Linear Logic")
;; (find-amadiocurienpage (+ 2 379) "14 Sequentiality")
;; (find-amadiocurientext (+ 2 379) "14 Sequentiality")
;; (find-amadiocurienpage (+ 2 429) "15 Domains and Realizability")
;; (find-amadiocurientext (+ 2 429) "15 Domains and Realizability")
;; (find-amadiocurienpage (+ 2 465) "16 Functions and Processes")
;; (find-amadiocurientext (+ 2 465) "16 Functions and Processes")
;; (find-amadiocurienpage (+ 2 495) "A Memento of Recursion Theory")
;; (find-amadiocurientext (+ 2 495) "A Memento of Recursion Theory")
;; (find-amadiocurienpage (+ 2 501) "B Memento of Category")
;; (find-amadiocurientext (+ 2 501) "B Memento of Category")
(code-djvu "howtowritemath" "~/books/__logic/steenrod_halmos_schiffer_dieudonne__how_to_write_mathematics.djvu")
;; (find-howtowritemathpage (+ 7 1) "Steenrod")
;; (find-howtowritemathpage (+ 7 19) "Halmos")
;; (find-howtowritemathpage (+ 7 49) "Schiffer")
;; (find-howtowritemathpage (+ 7 63) "Dieudonne")
(code-djvu "naivesettheory" "~/books/__logic/halmos__naive_set_theory.djvu")
(code-djvutotext "naivesettheory" "~/books/__logic/halmos__naive_set_theory.djvu")
;; (find-naivesettheorypage 9 "Contents")
;; (find-naivesettheorypage (+ 10 102) "Index")
;; (find-naivesettheorytext "")
(code-djvu "logicasalgebra" "~/books/__logic/halmos_givant__logic_as_algebra.djvu")
(code-djvutotext "logicasalgebra" "~/books/__logic/halmos_givant__logic_as_algebra.djvu")
;; (find-logicasalgebrapage 5 "Contents")
;; (find-logicasalgebrapage (+ 8 135) "Index")
;; (find-logicasalgebratext "")
;; http://gigapedia.com/items/360847/journal-of-automated-reasoning--1985-2008-
;; http://www.polimetrica.com/main/list.php
;; ~/books/__logic/slater__the_demathematisation_of_logic__openaccess.pdf
;; http://gigapedia.org/items/44097/types-and-programming-languages
;; ~/books/__logic/pierce__types_and_programming_languages.chm
;; (find-unpack-chm-links "~/books/__logic/pierce__types_and_programming_languages.chm" "~/usrc/piercetapl/" "piercetapl")
;; Broken?
(code-xpdf "vellerman" "~/books/__logic/vellerman__how_to_prove_it.pdf")
;; (find-vellermanpage 9 "Contents")
;; (find-vellermanpage (+ 14 381) "Index")
;; http://gigapedia.com/items/99143/residuated-lattices--an-algebraic-glimpse-at-substructural-logics--volume-151--studies-in-logic-and-the-foundations-of-mathematics---studies-in-logic-and-the-foundations-of-mathematics-
;; http://gigapedia.com/items/101018/substructural-logics--a-primer--trends-in-logic-
;; http://gigapedia.com/items/353519/substructural-logics--studies-in-logic-and-computation-
;; http://gigapedia.com/items/113448/quantification-in-nonclassical-logic--studies-in-logic-and-the-foundations-of-mathematics-
;; http://gigapedia.com/items/99488/analysis-and-synthesis-of-logics--how-to-cut-and-paste-reasoning-systems--applied-logic-series-
;; http://gigapedia.com/items/99492/philosophy-of-logic--handbook-of-the-philosophy-of-science-
;; http://gigapedia.com/items/104047/the-rise-of-modern-logic--from-leibniz-to-frege--volume-3--handbook-of-the-history-of-logic-
;; http://gigapedia.com/items/129108/interactive-logic--selected-papers-from-the-7th-augustus-de-morgan-workshop--london--aup---texts-in-logic-and-games-
;; http://gigapedia.com/items/62180/handbook-of-philosophical-logic--volume-9--2nd-edition
;; http://gigapedia.com/items/68348/handbook-of-philosophical-logic--volume-7--2nd-edition
;; http://gigapedia.com/items/68349/handbook-of-philosophical-logic--volume-8---2nd-edition
;; http://gigapedia.com/items/68350/handbook-of-philosophical-logic--volume-6---2nd-edition
;; http://gigapedia.com/items/68351/handbook-of-philosophical-logic--volume-5--2nd-edition
;; http://gigapedia.com/items/68352/handbook-of-philosophical-logic--volume-4--2nd-edition
;; http://gigapedia.com/items/68353/handbook-of-philosophical-logic--volume-3--2nd-edition
;; http://gigapedia.com/items/68354/handbook-of-philosophical-logic--volume-2--2nd-edition
;; http://gigapedia.com/items/69515/mathematical-problems-from-applied-logic-ii--logics-for-the-xxist-century--international-mathematical-series-
;; http://gigapedia.com/items/373805/logic--methodology-and-philosophy-of-science-iv--proceedings-of-the-4th-international-congress-for-logic--methodology--and-philosophy-of-science--bucharest--1971--studies-in-logic-and-the-foundations-of-mathematics--volume-74-
;; http://gigapedia.com/items/121856/analyses-of-aristotle--jaakko-hintikka-selected-papers-
;; http://gigapedia.com/items/104031/game-theoretical-semantics--essays-on-semantics-by-hintikka--carlson--peacocke--rantala-and-saarinen--studies-in-linguistics-and-philosophy-
;; http://gigapedia.com/items/105325/on-godel--wadsworth-philosophers-series-
;; http://gigapedia.com/items/84785/logic-for-computer-science---foundations-of-automatic-theorem-proving
;; http://search.gigapedia.com/?q=recursion
;; http://www.amazon.co.uk/Intuitionistic-Type-Theory-Giovanni-Lectures/dp/8870881059/ref=sr_1_4?ie=UTF8&s=books&qid=1263997364&sr=1-4
;; http://gigapedia.com/items/275307/foundations-without-foundationalism--a-case-for-second-order-logic--oxford-logic-guides-
;; Download these:
;; http://gigapedia.com/items/223615/a-course-in-mathematical-logic
;; http://gigapedia.com/items/108160/lectures-on-non--standard-analysis--lecture-notes-in-mathematics-
;; http://www.eecs.harvard.edu/shieber/Biblio/
;; http://gigapedia.com/items/376162/constraint-based-grammar-formalisms--parsing-and-type-inference-for-natural-and-computer-languages
;; http://gigapedia.com/items/5210/prolog-and-natural-language-analysis--center-for-the-study-of-language-and-information---lecture-notes-
;;
;; Local Variables:
;; mode: emacs-lisp
;; coding: utf-8-unix
;; End: