#### Filter Results:

- Full text PDF available (76)

#### Publication Year

1960

2017

- This year (9)
- Last 5 years (47)
- Last 10 years (59)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Adam Grabowski, Artur Kornilowicz, Adam Naumowicz
- J. Formalized Reasoning
- 2010

Mizar is the name of a formal language designed by Andrzej Trybulec for writing strictly formalized mathematical definitions and proofs, but is also used as the name of a computer program which isâ€¦ (More)

- Grzegorz Bancerek, Czeslaw Bylinski, +5 authors Josef Urban
- CICM
- 2015

- Adam Grabowski, Robert A. Kosinski
- Physical review. E, Statistical, nonlinear, andâ€¦
- 2006

We present a simple deterministic and based on local rules model of evolving social network, which leads to a network with the properties of a real social system, e.g., small-world topology andâ€¦ (More)

- Adam Grabowski
- 1996

In this paper X denotes a set. Let L be a lattice. Note that Poset(L) has l.u.b.â€™s and g.l.b.â€™s. Let L be an upper-bounded lattice. One can verify that Poset(L) is upper-bounded. Let L be aâ€¦ (More)

- Adam Grabowski, Artur Kornilowicz, Adam Naumowicz
- Journal of Automated Reasoning
- 2015

This special issue is dedicated to works related to Mizar,Â the theorem proving project started by Andrzej Trybulec in the 1970s, and other automated proof checking systems used for formalizingâ€¦ (More)

- Adam Grabowski
- 1994

The paper introduces some preliminary notions concerning the homotopy theory according to [15]: paths and arcwise connected to topological spaces. The basic operations on paths (addition andâ€¦ (More)

- Adam Grabowski, Robert A. Kosinski
- Physical review. E, Statistical, nonlinear, andâ€¦
- 2004

A model of epidemic spreading in a population with a hierarchical structure of interpersonal interactions is described and investigated numerically. The structure of interpersonal connections isâ€¦ (More)

- Adam Grabowski
- 2000

Let A be a set. One can verify that ã€ˆA, idAã€‰ is discrete. The following proposition is true (1) For every set X such that âˆ‡X âŠ† idX holds X is trivial. Let A be a relational structure. We say that Aâ€¦ (More)

- Adam Grabowski
- 2004

The following propositions are true: (1) For every natural number i1 such that 1 Â¬ i1 holds i1 âˆ’ â€² 1 < i1. (2) For all natural numbers i, k such that i + 1 Â¬ k holds 1 Â¬ k âˆ’ i. (3) For all naturalâ€¦ (More)

- Adam Grabowski, Christoph Schwarzweller
- Calculemus/MKM
- 2007

One major goal of Mathematical Knowledge Management is building extensive repositories, in which the mathematical knowledge has been verified. It appears, however, that maintaining such a repositoryâ€¦ (More)