Let X be a Polish space, Y a separable metrizable space, and f : X → Y a continuous surjection. We prove that if the image under f of every open set or every closed set is resolvable, then Y is Polish. This generalizes similar results by Sierpiński, Vainštain, and Ostrovsky.

“International Journal of Occupational Medicine and Environmental Health” (IJOMEH) is an English-language bimonthly (since 2013, earlier – a quarterly) founded in 1988 at the initiative of the Nofer Institute of Occupational Medicine in Łódź and the Main Board of the Polish Society of Occupational Medicine. IJOMEH popularizes the achievements of Polish scientific centers of occupational medicin...

We give a classical proof of the generalization of the characterization of smoothness to quotients of Polish spaces by Borel equivalence relations. As an application, we describe the extent to which any given Borel equivalence relation on a Polish space is encoded by the corresponding σ-ideal generated by the family of Borel sets on which it is smooth.

Although the first version of the Polsyn parser for the Polish language came into existence in 1997, there is no coherent description of it. This paper is an attempt to describe both the theoretical basis and the application of Polsyn. The parser is based on the Syntactical Groups Grammar for Polish (SGGP).

The paper1 presents a rule-based approach to semantic relation recognition within the Polish noun phrase. A set of semantic relations, including some thematic relations, has been determined for the need of experiments. The method consists in two steps: first the system recognizes word pairs and triples, and then it classifies the relations. Evaluation was performed on random samples from two ba...

This paper presents preliminary experiments on Open Relation Extraction for Polish. In particular, a variant of a priorart algorithm for open relation extraction for English has been adapted and tested on a set of articles from Polish on-line news. The paper provides initial evaluation results, which constitute the point of departure for in-depth research in this area.

Let H be a product of countably infinite number of copies of an uncountable Polish space X . Let Σξ (Σξ ) be the class of Borel sets of additive class ξ for the product of copies of the discrete topology on X (the Polish topology on X), and let B = ∪ξ<ω1Σξ . We prove in the Lévy–Solovay model that Σξ = Σξ ∩B

1Department of Mechanics and Physics of Fluids, Institute of Fundamental and Technological Research, Polish Academy of Sciences, Pawinskiego 5B, 02-106, Warsaw, Poland 2Department of Magnetism, Institute of Geophysics, Polish Academy of Sciences, ul. Ksiecia Janusza 64, 01-452 Warsaw, Poland 3Institute of Theoretical Physics, Faculty of Physics, University of Warsaw, Hoza 69, 00-681, Warsaw, Po...

The Polish Conference on Analytical Chemistry has a long and rich history. The first such scientific forum took place in Warsaw in 1981. Since 1995, Polish analysts have had a chance to meet every 5 years in Gdańsk, Gliwice, Toruń, and—in 2010—in Kraków. The VIIIth Polish Conference on Analytical Chemistry was held on July 4–9. It was organized by the Department of Analytical Chemistry, Jagiell...

Non-abelian Polish groups arising as countable products of countable groups can be tame in arbitrarily complicated ways. This contrasts with some results of Solecki who revealed a very different picture in the abelian case. 0. Group trees. The class of all Polish (completely metrizable, separable) groups may be naturally divided into two classes. 0.1. Definition. A Polish group G is tame if whe...