Bøker utgitt av Uniwersytet Jagiellonski, Wydawnictwo

In recent years, there has been intensive development of the Polish civil aviation sector, especially regional airports. Effective growth requires a diagnosis of their competitiveness in today's turbulent passenger transport market. The book compares regional airports in Poland with competitive European ports. It uses econometric analysis to model regional airport competitiveness, which is applicable to practical management of modern airports. The book also analyzes possible directions of the growth of Polish airports, taking into account the current economic and political situation as well as forecasts for passenger transport sector development.

The present volume is a token of gratitude for our colleague, Janina Aniela Ozga, a senior lecturer at the Institute of English Philology of the Jagiellonian University. The book is a collection of papers on a wide spectrum of topics, ranging from Hamlet to Zoolander, which reflect diverse academic interests of the authors: literary theory, linguistics, translation studies, philosophy of language, history and language teaching. The common thread running through all the papers is the desire of the authors - all of them humanists involved in academic pursuits - to place in a theoretical perspective of their discipline and shed new light on an interesting research problem in literature, art, language use, or language teaching that they have identified.

This book stands at the intersection of two topics: the decidability and computational complexity of hybrid logics, and the deductive systems designed for them. Hybrid logics are here divided into two groups: standard hybrid logics involving nominals as expressions of a separate sort, and non-standard hybrid logics, which do not involve nominals but whose expressive power matches the expressive power of binder-free standard hybrid logics.The original results of this book are split into two parts. This division reflects the division of the book itself. The first type of results concern model-theoretic and complexity properties of hybrid logics. Since hybrid logics which we call standard are quite well investigated, the efforts focused on hybrid logics referred to as non-standard in this book. Non-standard hybrid logics are understood as modal logics with global counting operators (M(En)) whose expressive power matches the expressive power of binder-free standard hybrid logics. The relevant results comprise: 1. Establishing a sound and complete axiomatization for the modal logic K with global counting operators (MK(En)), which can be easily extended onto other frame classes, 2. Establishing tight complexity bounds, namely NExpTime-completeness for the modal logic with global counting operators defined over the classes of arbitrary, reflexive, symmetric, serial and transitive frames (MK(En)), MT(En)), MD(En)), MB(En)), MK4(En)) with numerical subscripts coded in binary. Establishing the exponential-size model property for this logic defined over the classes of Euclidean and equivalential frames (MK5(En)), MS5(En)).Results of the second type consist of designing concrete deductive (tableau and sequent) systems for standard and non-standard hybrid logics. More precisely, they include: 1. Devising a prefixed and an internalized tableau calculi which are sound, complete and terminating for a rich class of binder-free standard hybrid logics. An interesting feature of indicated calculi is the nonbranching character of the rule (¬D), 2. Devising a prefixed and an internalized tableau calculi which are sound, complete and terminating for non-standard hybrid logics. The internalization technique applied to a tableau calculus for the modal logic with global counting operators is novel in the literature, 3. Devising the first hybrid algorithm involving an inequality solver for modal logics with global counting operators. Transferring the arithmetical part of reasoning to an inequality solver turned out to be sufficient in ensuring termination.The book is directed to philosophers and logicians working with modal and hybrid logics, as well as to computer scientists interested in deductive systems and decision procedures for logics. Extensive fragments of the first part of the book can also serve as an introduction to hybrid logics for wider audience interested in logic.The content of the book is situated in the areas of formal logic and theoretical computer science with some elements of the theory of computational complexity.