Pokaż uproszczony rekord

dc.contributor.authorMakinson, David
dc.date.accessioned2021-05-11T06:22:46Z
dc.date.available2021-05-11T06:22:46Z
dc.date.issued2020-12-30
dc.identifier.issn0138-0680
dc.identifier.urihttp://hdl.handle.net/11089/35461
dc.description.abstractWe comment on certain features that second-level inference rules commonly used in mathematical proof sometimes have, sometimes lack: suppositions, indirectness, goal-simplification, goal-preservation and premise-preservation. The emphasis is on the roles of these features, which we call 'perfumes', in mathematical practice rather than on the space of all formal possibilities, deployment in proof-theory, or conventions for display in systems of natural deduction.en
dc.language.isoen
dc.publisherWydawnictwo Uniwersytetu Łódzkiegopl
dc.relation.ispartofseriesBulletin of the Section of Logic;4en
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/4.0
dc.subjectsecond-level inferenceen
dc.subjectsuppositionsen
dc.subjectindirect inferenceen
dc.subjectgoal simplificationen
dc.subjectgoal preservationen
dc.subjectwlogen
dc.subjectpremise preservationen
dc.titleThe Phenomenology of Second-Level Inference: Perfumes in The Deductive Gardenen
dc.typeOther
dc.page.number327-342
dc.contributor.authorAffiliationLes Etangs, B2 Domaine de la Ronce 92410 Ville d'Avray Franceen
dc.identifier.eissn2449-836X
dc.references[1] G. Gentzen, Untersuchungen über das logische Schliessen, Mathematische Zeitschrift, vol. 23 (1934), pp. 176–210, 405–431, DOI: http://dx.doi.org/10.1007/BF01201353 English translation: Investigation into logical deduction, pp. 68–131 of The Collected Papers of Gerhard Gentzen, ed. M. E. Szabo. North-Holland, Amsterdam, 1969.en
dc.references[2] J. Harrison, Without loss of generality, [in:] S. Berghofer, T. Nipkow (eds.), Theorem-Proving in Higher Order Logics, vol. 5674 of Lecture Notes in Computer Science, Springer, Berlin (2009), pp. 43–59, DOI: http://dx.doi.org/10.1007/978-3-642-03359-9_3en
dc.references[3] A. Indrzejczak, Natural Deduction, Hybrid Systems and Modal Logic, Springer, Dordrecht (2010), DOI: http://dx.doi.org/10.1007/978-90481-8785-0en
dc.references[4] A. Indrzejczak, Natural Deduction, Internet Encyclopedia of Philosophy, (2015), URL: https://iep.utm.edu/nat-ded/ consulted 16.07.2020.en
dc.references[5] S. Ja_skowski, On the rules of suppositions in formal logic, Studia Logica, vol. 1 (1934), pp. 1–32.en
dc.references[6] D. Kalish, R. Montague, Logic: Techniques of Formal Reasoning, Harcourt Brace, New York (1964), also second edition with co-author G. Mar, Oxford University Press, 2001.en
dc.references[7] J. Lucas, Introduction to Abstract Mathematics, 2nd ed., Rowman & Little_eld, Maryland, USA (1990).en
dc.references[8] D. Makinson, Sets, Logic and Maths for Computing, 3rd ed., Undergraduate Topics in Computer Science, Springer, London (2020), DOI: http://dx.doi.org/10.1007/978-1-4471-2500-6en
dc.references[9] D. Makinson, Relevance-sensitive truth-trees, [in:] Alasdair Urquhart on Nonclassical and Algebraic Logic and Complexity of Proofs, Outstanding Contributions to Logic, Springer, Berlin (2021), to appear.en
dc.references[10] J. Pelletier, A brief history of natural deduction, History and Philosophy of Logic, vol. 20 (1999), pp. 1–31, DOI: http://dx.doi.org/10.1080/014453499298165en
dc.references[11] J. Pelletier, A. P. Hazen, A history of natural deduction, [in:] D. Gabbay, F. J. Pelletier, E. Woods (eds.), Handbook of the History of Logic, vol. 11, North-Holland, Amsterdam (2012), pp. 341–414, DOI: http://dx.doi.org/10.1016/B978-0-444-52937-4.50007-1en
dc.references[12] E. Schechter, Constructivism is di_cult, American Mathematical Monthly, vol. 108 (2001), pp. 50–54, DOI: http://dx.doi.org/10.1080/00029890.2001.11919720en
dc.references[13] R. Sikorski, Boolean Algebras, 2nd ed., Springer, Berlin (1964), DOI: http://dx.doi.org/10.1007/978-3-662-01507-0en
dc.contributor.authorEmaildavid.makinson@gmail.com
dc.identifier.doi10.18778/0138-0680.2020.23
dc.relation.volume49


Pliki tej pozycji

Thumbnail

Pozycja umieszczona jest w następujących kolekcjach

Pokaż uproszczony rekord

https://creativecommons.org/licenses/by-nc-nd/4.0
Poza zaznaczonymi wyjątkami, licencja tej pozycji opisana jest jako https://creativecommons.org/licenses/by-nc-nd/4.0