Single shot imaging of trapped Fermi gas

Recently developed techniques allow for simultaneous measurements of the positions of all ultra cold atoms in a trap with high resolution. Each such single shot experiment detects one element of the quantum ensemble formed by the cloud of atoms. Repeated single shot measurements can be used to determine all correlations between particle positions as opposed to standard measurements that determine particle density or two-particle correlations only. In this paper we discuss the possible outcomes of such single shot measurements in case of cloud of ultra-cold non-interacting Fermi atoms. We show that the Pauli exclusion principle alone leads to correlations between particle positions that originate from unexpected spatial structures formed by the atoms

Chapter Dynamic Dispatch for Method Contracts Through Abstract Predicates

Dynamic method dispatch is a core feature of object-oriented programming by which the executed implementation for a polymorphic method is only chosen at runtime. In this paper, we present a specification and verification methodology which extends the concept of dynamic dispatch to design-by-contract specifications. The formal specification language JML has only rudimentary means for polymorphic abstraction in expressions. We promote these to fully flexible specification-only query methods called model methods that can, like ordinary methods, be overridden to give specifications a new semantics in subclasses in a transparent and modular fashion. Moreover, we allow them to refer to more than one program state which give us the possibility to fully abstract and encapsulate two-state specification contexts, i.e., history constraints and method postconditions. Finally, we provide an elegant and flexible mechanism to specify restrictions on specifications in subtypes. Thus behavioural subtyping can be enforced, yet it still allows for other specification paradigms. We provide the semantics for model methods by giving a translation into a first order logic and according proof obligations. We fully implemented this framework in the KeY program verifier and successfully verified relevant examples. We have also implemented an extension to KeY to support permission-based verification of concurrent Java programs. In this context model methods provide a modular specification method to treat code synchronisation through API methods

Computational complexity of the semantics of some natural language constructions

AbstractWe consider an example of a sentence which according to Hintikka's claim essentially requires for its logical form a Henkin quantifier. We show that if Hintikka is right then recognizing the truth value of the sentence in finite models is an NP-complete problem. We discuss also possible conclusions from this observation

Introduction. The School: Its Genesis, Development and Significance

The Introduction outlines, in a concise way, the history of the Lvov-Warsaw School – a most unique Polish school of worldwide renown, which pioneered trends combining philosophy, logic, mathematics and language. The author accepts that the beginnings of the School fall on the year 1895, when its founder Kazimierz Twardowski, a disciple of Franz Brentano, came to Lvov on his mission to organize a scientific circle. Soon, among the characteristic features of the School was its serious approach towards philosophical studies and teaching of philosophy, dealing with philosophy and propagation of it as an intellectual and moral mission, passion for clarity and precision, as well as exchange of thoughts, and cooperation with representatives of other disciplines.The genesis is followed by a chronological presentation of the development of the School in the successive years. The author mentions all the key representatives of the School (among others, Ajdukiewicz, Lesniewski, Łukasiewicz,Tarski), accompanying the names with short descriptions of their achievements. The development of the School after Poland’s regaining independence in 1918 meant part of the members moving from Lvov to Warsaw, thus providing the other segment to the name – Warsaw School of Logic. The author dwells longer on the activity of the School during the Interwar period – the time of its greatest prosperity, which ended along with the outbreak of World War 2. Attempts made after the War to recreate the spirit of the School are also outlined and the names of followers are listed accordingly. The presentation ends with some concluding remarks on the contribution of the School to contemporary developments in the fields of philosophy, mathematical logic or computer science in Poland

Winning Cores in Parity Games

We introduce the novel notion of winning cores in parity games and develop a deterministic polynomial-time under-approximation algorithm for solving parity games based on winning core approximation. Underlying this algorithm are a number properties about winning cores which are interesting in their own right. In particular, we show that the winning core and the winning region for a player in a parity game are equivalently empty. Moreover, the winning core contains all fatal attractors but is not necessarily a dominion itself. Experimental results are very positive both with respect to quality of approximation and running time. It outperforms existing state-of-the-art algorithms significantly on most benchmarks