Skip to main content
Have a personal or library account? Click to login
Pseudo-Canonical Formulae are Classical Cover

Pseudo-Canonical Formulae are Classical

Formalized Mathematics
Volume 22 (2014): Issue 2 (June 2014)
By:  and    
Open Access
|Jun 2014
References

References

  1. [1] Grzegorz Bancerek. Cardinal numbers., 1(2):377–382, 1990.
    Search in Google Scholar
  2. [2] Grzegorz Bancerek. The ordinal numbers., 1(1):91–96, 1990.
    Search in Google Scholar
  3. [3] Czesław Byliński. Functions and their basic properties., 1(1): 55–65, 1990.
    Search in Google Scholar
  4. [4] Czesław Byliński. Functions from a set to a set., 1(1):153–164, 1990.
    Search in Google Scholar
  5. [5] Czesław Byliński. Basic functions and operations on functions., 1(1):245–254, 1990.
    Search in Google Scholar
  6. [6] Czesław Byliński. The modification of a function by a function and the iteration of the composition of a function., 1(3):521–527, 1990.
    Search in Google Scholar
  7. [7] Czesław Byliński. Partial functions., 1(2):357–367, 1990.
    Search in Google Scholar
  8. [8] Czesław Byliński. Some basic properties of sets., 1(1):47–53, 1990.
    Search in Google Scholar
  9. [9] Marco B. Caminati. Preliminaries to classical first order model theory., 19(3):155–167, 2011. doi:10.2478/v10037-011-0025-2.
    Open DOISearch in Google Scholar
  10. [10] Agata Darmochwał. Finite sets., 1(1):165–167, 1990.
    Search in Google Scholar
  11. [11] Adam Grabowski. Hilbert positive propositional calculus., 8(1): 69–72, 1999.
    Search in Google Scholar
  12. [12] Beata Padlewska. Families of sets., 1(1):147–152, 1990.
    Search in Google Scholar
  13. [13] Piotr Rudnicki and Andrzej Trybulec. Abian’s fixed point theorem., 6(3):335–338, 1997.
    Search in Google Scholar
  14. [14] Andrzej Trybulec. Domains and their Cartesian products., 1(1): 115–122, 1990.
    Search in Google Scholar
  15. [15] Andrzej Trybulec. Binary operations applied to functions., 1 (2):329–334, 1990.
    Search in Google Scholar
  16. [16] Andrzej Trybulec. Defining by structural induction in the positive propositional language., 8(1):133–137, 1999.
    Search in Google Scholar
  17. [17] Andrzej Trybulec. The canonical formulae., 9(3):441–447, 2001.
    Search in Google Scholar
  18. [18] Andrzej Trybulec. Classes of independent partitions., 9(3): 623–625, 2001.
    Search in Google Scholar
  19. [19] Zinaida Trybulec. Properties of subsets., 1(1):67–71, 1990.
    Search in Google Scholar
  20. [20] Edmund Woronowicz. Relations and their basic properties., 1 (1):73–83, 1990.
    Search in Google Scholar
  21. [21] Edmund Woronowicz. Relations defined on sets., 1(1):181–186, 1990.
    Search in Google Scholar
  22. [22] Edmund Woronowicz and Anna Zalewska. Properties of binary relations., 1(1):85–89, 1990.
    Search in Google Scholar
DOI: https://doi.org/10.2478/forma-2014-0011 | Journal eISSN: 1898-9934 | Journal ISSN: 1426-2630
Journal RSS Feed
Language: English
Page range: 99 - 103
Submitted on: May 25, 2014
Published on: Jun 30, 2014
Published by: University of Białystok
In partnership with: Paradigm Publishing Services
Keywords:
Hilbert positive propositional calculus,
classical logic,
canonical,
formulae
MSC:
03B20 03B35
Related subjects:
Computer sciences,
Artificial intelligence,
Computer sciences, other,
Mathematics,
Logic and set theory,
General mathematics

© 2014 Marco B. Caminati, Artur Korniłowicz, published by University of Białystok
This work is licensed under the Creative Commons Attribution-ShareAlike 3.0 License.

Volume 22 (2014): Issue 2 (June 2014)
Previous article
Next article