Trybulec, Andrzej (1941-2013).
Trybulec, Andrzej
Andrzej Trybulec polski matematyk i informatyk
Andrzej Trybulec
Trybulec, Andrzej, 1941-
VIAF ID: 21658345 ( Personal )
Permalink: http://viaf.org/viaf/21658345
Preferred Forms
- 100 0 _ ‡a Andrzej Trybulec
- 100 0 _ ‡a Andrzej Trybulec ‡c polski matematyk i informatyk
- 100 1 _ ‡a Trybulec, Andrzej
-
-
-
- 100 1 _ ‡a Trybulec, Andrzej
-
-
-
-
4xx's: Alternate Name Forms (13)
Works
Title | Sources |
---|---|
A collection of TEXed Mizar abstracts | |
Decomposing a Go-board into cells | |
Defining by structural induction in the positive propositional language | |
Enumerated sets | |
Euclid's algorithm | |
The evaluation of multivariate polynomials | |
Examples of category structures | |
An extension of SCM | |
The Fashoda meet theorem for continuous mappings | |
Finite Join and Finite Meet and Dual Lattices | |
Fixpoints in complete lattices | |
From insight to proof : festschrift in honour of Andrzej Trybulec | |
Function Domains and Frænkel Operator | |
Functors for alternative categories | |
The fundamental logic structure in quantum mechanics | |
Gauges and cages. | |
Hahn-Banach theorem | |
Introducing spans | |
Introduction to Circuits, I | |
Isomorphisms of categories | |
Język informacyjno-logiczny Mizar-MSE | |
Kuratowski - Zorn Lemma | |
Laplace expansion | |
Lattice of Subgroups of a Group. Frattini Subgroup | |
Lebesgue's covering lemma, uniform continuity and segmentation of arcs | |
Left and right component of the complement of a special closed curve | |
Many-sorted sets | |
Mathematical knowledge management : third international conference, MKM 2004, Białowieża, Poland, September 19-21, 2004 : proceedings | |
Memory handling for SCMFSA | |
Miscellaneous facts about functions | |
The MIZAR logic information language | |
MIZAR syntax | |
MKM 2004 | |
Moore-Smith convergence | |
More on segments on a Go-board | |
More on the external approximation of a continuum | |
Natural transformations. Discrete categorie | |
Non-contiguous Substrings and One-to-one Finite Sequences | |
On a mathematical model of programs | |
On same equivalents of well-foundedness | |
On the composition of macro instructions. | |
On the decomposition of a simple closed curve into two arcs | |
On the geometry of a Go-board | |
On the minimal distance between sets in Euclidean space | |
On the order on a special polygon | |
On the rectangular finite sequences of the points of the plane | |
On the sets inhabited by numbers | |
Partially Ordered Sets | |
Pewien algorytm konstruowania klasyfikacji w przestrzeniach metrycznych / Roman Matuszewski, Andrzej Trybulec. | |
Pigeon Hole Principle | |
Podziały słownika w językach z paradygmatami | |
Preliminaries to circuits, II | |
Preparing the internal approximations of simple closed curves | |
Propositional Calculus | |
Relocability for SCMFSA | |
Rotating and reversing | |
Rozpoznawanie stanów pamięci przez procesor / Andrzej Trybulec. - Warszawa, 1973. | |
The SCMFSA computer | |
Scott topology | |
Semilattice Operations on Finite Subsets / Andrzej Trybulec. | |
Sequences of metric spaces and an abstract intermediate value theorem | |
Similarity of formulae | |
Some lemmas for the Jordan curve theorem | |
Some properties of special polygonal curves | |
Some remarks on the simple concrete model of computer | |
Some topological properties of cells in R2 | |
Standard ordering of instruction locations | |
Subspaces and Cosets of Subspaces in Vector Space | |
Tarski Grothendieck Set Theory | |
Tuples, Projections and Cartesian Products | |
Vectors in Real Linear Space |