REPOZYTORIUM UNIWERSYTETU
W BIAŁYMSTOKU
UwB

  1. Repozytorium Uniwersytetu w Białymstoku
  2. Czasopisma naukowe / Journals
  3. Formalized Mathematics
  4. Formalized Mathematics, 2012, Volume 20, Issue 3

Szukanie zaawansowane
  • Zespoły i Kolekcje


  • Zaloguj się
  • Zarejestruj się
  • Mój RUB
  • FAQ
  • Polityka
  • Regulamin
  • DOI
  • Instrukcja
  • Aspekty prawne
  • Open Access
  • Archiwum


  • Kontakt
  • O Dspace
  • Strona Biblioteki
  • Strona Uczelni



    • Proszę używać tego identyfikatora do cytowań lub wstaw link do tej pozycji: http://hdl.handle.net/11320/3642
    Pełny rekord metadanych
    Pole DCWartośćJęzyk
    dc.contributor.authorSchlöder, Julian J.-
    dc.contributor.authorKoepke, Peter-
    dc.date.accessioned2015-12-06T19:05:55Z-
    dc.date.available2015-12-06T19:05:55Z-
    dc.date.issued2012-
    dc.identifier.citationFormalized Mathematics, Volume 20, Issue 3, 2012, Pages 193-197-
    dc.identifier.issn1426-2630-
    dc.identifier.issn1898-9934-
    dc.identifier.urihttp://hdl.handle.net/11320/3642-
    dc.descriptionThis article is part of the first author’s Bachelor thesis under the supervision of the second author.-
    dc.description.abstractThis article is the first in a series of two Mizar articles constituting a formal proof of the Gödel Completeness theorem [17] for uncountably large languages. We follow the proof given in [18]. The present article contains the techniques required to expand formal languages. We prove that consistent or satisfiable theories retain these properties under changes to the language they are formulated in.-
    dc.language.isoen-
    dc.publisherDe Gruyter Open-
    dc.titleTransition of Consistency and Satisfiability under Language Extensions-
    dc.typeArticle-
    dc.identifier.doi10.2478/v10037-012-0022-0-
    dc.description.AffiliationSchlöder Julian J. - Mathematisches Institut, Rheinische Friedrich-Wilhelms-Universität Bonn, Endenicher Allee 60, D-53113 Bonn, Germany-
    dc.description.AffiliationKoepke Peter - Mathematisches Institut, Rheinische Friedrich-Wilhelms-Universität Bonn, Endenicher Allee 60, D-53113 Bonn, Germany-
    dc.description.referencesGrzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377-382, 1990.-
    dc.description.referencesGrzegorz Bancerek. König’s theorem. Formalized Mathematics, 1(3):589-593, 1990.-
    dc.description.referencesGrzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91-96, 1990.-
    dc.description.referencesGrzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107-114, 1990.-
    dc.description.referencesPatrick Braselmann and Peter Koepke. Coincidence lemma and substitution lemma. Formalized Mathematics, 13(1):17-26, 2005.-
    dc.description.referencesPatrick Braselmann and Peter Koepke. Equivalences of inconsistency and Henkin models. Formalized Mathematics, 13(1):45-48, 2005.-
    dc.description.referencesPatrick Braselmann and Peter Koepke. G¨odel’s completeness theorem. Formalized Mathematics, 13(1):49-53, 2005.-
    dc.description.referencesPatrick Braselmann and Peter Koepke. A sequent calculus for first-order logic. Formalized Mathematics, 13(1):33-39, 2005.-
    dc.description.referencesPatrick Braselmann and Peter Koepke. Substitution in first-order formulas: Elementary properties. Formalized Mathematics, 13(1):5-15, 2005.-
    dc.description.referencesPatrick Braselmann and Peter Koepke. Substitution in first-order formulas. Part II. The construction of first-order formulas. Formalized Mathematics, 13(1):27-32, 2005.-
    dc.description.referencesCzesław Bylinski. A classical first order language. Formalized Mathematics, 1(4):669-676, 1990.-
    dc.description.referencesCzesław Bylinski. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990.-
    dc.description.referencesCzesław Bylinski. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.-
    dc.description.referencesCzesław Bylinski. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990.-
    dc.description.referencesAgata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165-167, 1990.-
    dc.description.referencesAgata Darmochwał. A first-order predicate calculus. Formalized Mathematics, 1(4):689-695, 1990.-
    dc.description.referencesKurt Gödel. Die Vollst¨andigkeit der Axiome des logischen Funktionenkalk¨uls. Monatshefte f¨ur Mathematik und Physik 37, 1930.-
    dc.description.referencesW. Thomas H.-D. Ebbinghaus, J. Flum. Einf¨uhrung in die Mathematische Logik. Springer-Verlag, Berlin Heidelberg, 2007.-
    dc.description.referencesPiotr Rudnicki and Andrzej Trybulec. A first order language. Formalized Mathematics, 1(2):303-311, 1990.-
    dc.description.referencesZinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.-
    dc.description.referencesEdmund Woronowicz. Interpretation and satisfiability in the first order logic. Formalized Mathematics, 1(4):739-743, 1990.-
    dc.description.referencesEdmund Woronowicz. Many argument relations. Formalized Mathematics, 1(4):733-737, 1990.-
    dc.description.referencesEdmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1(1):73-83, 1990.-
    dc.description.referencesEdmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990.-
    Występuje w kolekcji(ach):Formalized Mathematics, 2012, Volume 20, Issue 3

    Pliki w tej pozycji:
    Plik Opis RozmiarFormat 
    v10037-012-0022-0.pdf236,67 kBAdobe PDFOtwórz
    Pokaż uproszczony widok rekordu Zobacz statystyki


    Pozycja ta dostępna jest na podstawie licencji Licencja Creative Commons CCL Creative Commons