6 research outputs found

    Preface

    Get PDF
    Grabowski Adam - Institute of Informatics, University of Białystok, Akademicka 2, 15-267 Białystok, PolandShidama Yasunari - Shinshu University, Nagano, JapanGrzegorz Bancerek. Cardinal numbers. Formalized Mathematics, 1(2):377–382, 1990.Grzegorz Bancerek. Tarski’s classes and ranks. Formalized Mathematics, 1(3):563–567, 1990.Grzegorz Bancerek. The fundamental properties of natural numbers. Formalized Mathematics, 1(1):41–46, 1990.Grzegorz Bancerek. The ordinal numbers. Formalized Mathematics, 1(1):91–96, 1990.Grzegorz Bancerek and Krzysztof Hryniewiecki. Segments of natural numbers and finite sequences. Formalized Mathematics, 1(1):107–114, 1990.Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1): 55–65, 1990.Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153–164, 1990.Czesław Byliński. Partial functions. Formalized Mathematics, 1(2):357–367, 1990.Czesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47–53, 1990.Agata Darmochwał. Compact spaces. Formalized Mathematics, 1(2):383–386, 1990.Agata Darmochwał. The Euclidean space. Formalized Mathematics, 2(4):599–603, 1991.Agata Darmochwał. Finite sets. Formalized Mathematics, 1(1):165–167, 1990.Agata Darmochwał. Families of subsets, subspaces and mappings in topological spaces. Formalized Mathematics, 1(2):257–261, 1990.Ryszard Engelking. Teoria wymiaru. PWN, 1981.Adam Grabowski. Properties of the product of compact topological spaces. Formalized Mathematics, 8(1):55–59, 1999.Zbigniew Karno. Separated and weakly separated subspaces of topological spaces. Formalized Mathematics, 2(5):665–674, 1991.Artur Korniłowicz. Jordan curve theorem. Formalized Mathematics, 13(4):481–491, 2005.Artur Korniłowicz. The definition and basic properties of topological groups. Formalized Mathematics, 7(2):217–225, 1998.Artur Korniłowicz and Yasunari Shidama. Brouwer fixed point theorem for disks on the plane. Formalized Mathematics, 13(2):333–336, 2005.Artur Korniłowicz and Yasunari Shidama. Intersections of intervals and balls in EnT. Formalized Mathematics, 12(3):301–306, 2004.Robert Milewski. Bases of continuous lattices. Formalized Mathematics, 7(2):285–294, 1998.Yatsuka Nakamura and Andrzej Trybulec. Components and unions of components. Formalized Mathematics, 5(4):513–517, 1996.Beata Padlewska. Connected spaces. Formalized Mathematics, 1(1):239–244, 1990.Beata Padlewska. Locally connected spaces. Formalized Mathematics, 2(1):93–96, 1991.Beata Padlewska. Families of sets. Formalized Mathematics, 1(1):147–152, 1990.Beata Padlewska and Agata Darmochwał. Topological spaces and continuous functions. Formalized Mathematics, 1(1):223–230, 1990.Karol Pąk. Tietze extension theorem for n-dimensional spaces. Formalized Mathematics, 22(1):11–19. doi:10.2478/forma-2014-0002.Konrad Raczkowski and Paweł Sadowski. Equivalence relations and classes of abstraction. Formalized Mathematics, 1(3):441–444, 1990.Marco Riccardi. The definition of topological manifolds. Formalized Mathematics, 19(1): 41–44, 2011. doi:10.2478/v10037-011-0007-4.Andrzej Trybulec. A Borsuk theorem on homotopy types. Formalized Mathematics, 2(4): 535–545, 1991.Andrzej Trybulec. On the geometry of a Go-Board. Formalized Mathematics, 5(3):347– 352, 1996.Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67–71, 1990.Edmund Woronowicz. Relations and their basic properties. Formalized Mathematics, 1 (1):73–83, 1990.Mirosław Wysocki and Agata Darmochwał. Subsets of topological spaces. Formalized Mathematics, 1(1):231–237, 1990

    6th Podlasie Conference on Mathematics (6PCM)

    Get PDF
    Sprawozdanie z konferencji naukowej zorganizowanej przez Polskie Towarzystwo Matematyczne. Oddział w Białymstocki, Wydział Ekonomii i Zarządzania Uniwersytetu w Białymstoku, Wydział Matematyki i Informatyki Uniwersytetu w Białymstoku oraz Wydział Informatyki Politechniki Białostockiej, 1-4 lipca 2014 r.Uniwersytet w Białymstoku5(71)24324

    The Higher-Order Prover Leo-II.

    Get PDF
    Leo-II is an automated theorem prover for classical higher-order logic. The prover has pioneered cooperative higher-order-first-order proof automation, it has influenced the development of the TPTP THF infrastructure for higher-order logic, and it has been applied in a wide array of problems. Leo-II may also be called in proof assistants as an external aid tool to save user effort. For this it is crucial that Leo-II returns proof information in a standardised syntax, so that these proofs can eventually be transformed and verified within proof assistants. Recent progress in this direction is reported for the Isabelle/HOL system.The Leo-II project has been supported by the following grants: EPSRC grant EP/D070511/1 and DFG grants BE/2501 6-1, 8-1 and 9-1.This is the final version of the article. It first appeared from Springer via http://dx.doi.org/10.1007/s10817-015-9348-y

    Automated Deduction – CADE 28

    Get PDF
    This open access book constitutes the proceeding of the 28th International Conference on Automated Deduction, CADE 28, held virtually in July 2021. The 29 full papers and 7 system descriptions presented together with 2 invited papers were carefully reviewed and selected from 76 submissions. CADE is the major forum for the presentation of research in all aspects of automated deduction, including foundations, applications, implementations, and practical experience. The papers are organized in the following topics: Logical foundations; theory and principles; implementation and application; ATP and AI; and system descriptions
    corecore