The complexity of linear-time temporal logic over the class of ordinals

We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic by Kamp's theorem. We show that it has a PSPACE-complete satisfiability problem over the class of ordinals. Among the consequences of our proof, we show that given the code of some countable ordinal alpha and a formula, we can decide in PSPACE whether the formula has a model over alpha. In order to show these results, we introduce a class of simple ordinal automata, as expressive as B\"uchi ordinal automata. The PSPACE upper bound for the satisfiability problem of the temporal logic is obtained through a reduction to the nonemptiness problem for the simple ordinal automata.Comment: Accepted for publication in LMC

Proving Termination Starting from the End

We present a novel technique for proving program termination which introduces a new dimension of modularity. Existing techniques use the program to incrementally construct a termination proof. While the proof keeps changing, the program remains the same. Our technique goes a step further. We show how to use the current partial proof to partition the transition relation into those behaviors known to be terminating from the current proof, and those whose status (terminating or not) is not known yet. This partition enables a new and unexplored dimension of incremental reasoning on the program side. In addition, we show that our approach naturally applies to conditional termination which searches for a precondition ensuring termination. We further report on a prototype implementation that advances the state-of-the-art on the grounds of termination and conditional termination.Comment: 16 page

Where would we be without counterfactuals?

Huw Price gives his inaugural lecture as Bertrand Russell Professor of Philosophy. Bertrand Russell’s celebrated essay “On the Notion of Cause” was first delivered to the Aristotelian Society on 4 November 1912, as Russell’s Presidential Address. The piece is best known for a passage in which its author deftly positions himself between the traditional metaphysics of causation and the British crown, firing broadsides in both directions: “The law of causality”, Russell declares, “Like much that passes muster in philosophy, is a relic of a bygone age, surviving, like the monarchy, only because it is erroneously supposed to do no harm.” To mark the lecture’s centenary, we offer a contemporary view of the issues Russell here puts on the table, and of the health or otherwise, at the end of the essay’s first century, of his notorious conclusion

A polychromatic Ramsey theory for ordinals

The Ramsey degree of an ordinal α is the least number n such that any colouring of the edges of the complete graph on α using finitely many colours contains an n-chromatic clique of order type α. The Ramsey degree exists for any ordinal α < ω ω . We provide an explicit expression for computing the Ramsey degree given α. We further establish a version of this result for automatic structures. In this version the ordinal and the colouring are presentable by finite automata and the clique is additionally required to be regular. The corresponding automatic Ramsey degree turns out to be greater than the set theoretic Ramsey degree. Finally, we demonstrate that a version for computable structures fails

Trees over Infinite Structures and Path Logics with Synchronization

We provide decidability and undecidability results on the model-checking problem for infinite tree structures. These tree structures are built from sequences of elements of infinite relational structures. More precisely, we deal with the tree iteration of a relational structure M in the sense of Shelah-Stupp. In contrast to classical results where model-checking is shown decidable for MSO-logic, we show decidability of the tree model-checking problem for logics that allow only path quantifiers and chain quantifiers (where chains are subsets of paths), as they appear in branching time logics; however, at the same time the tree is enriched by the equal-level relation (which holds between vertices u, v if they are on the same tree level). We separate cleanly the tree logic from the logic used for expressing properties of the underlying structure M. We illustrate the scope of the decidability results by showing that two slight extensions of the framework lead to undecidability. In particular, this applies to the (stronger) tree iteration in the sense of Muchnik-Walukiewicz.Comment: In Proceedings INFINITY 2011, arXiv:1111.267

A Quantum-Bayesian Route to Quantum-State Space

In the quantum-Bayesian approach to quantum foundations, a quantum state is viewed as an expression of an agent's personalist Bayesian degrees of belief, or probabilities, concerning the results of measurements. These probabilities obey the usual probability rules as required by Dutch-book coherence, but quantum mechanics imposes additional constraints upon them. In this paper, we explore the question of deriving the structure of quantum-state space from a set of assumptions in the spirit of quantum Bayesianism. The starting point is the representation of quantum states induced by a symmetric informationally complete measurement or SIC. In this representation, the Born rule takes the form of a particularly simple modification of the law of total probability. We show how to derive key features of quantum-state space from (i) the requirement that the Born rule arises as a simple modification of the law of total probability and (ii) a limited number of additional assumptions of a strong Bayesian flavor.Comment: 7 pages, 1 figure, to appear in Foundations of Physics; this is a condensation of the argument in arXiv:0906.2187v1 [quant-ph], with special attention paid to making all assumptions explici

Using the stated preference method for the calculation of social discount rate

The aim of this paper is to build the stated preference method into the social discount rate methodology. The first part of the paper presents the results of a survey about stated time preferences through pair-choice decision situations for various topics and time horizons. It is assumed that stated time preferences differ from calculated time preferences and that the extent of stated rates depends on the time period, and on how much respondents are financially and emotionally involved in the transactions. A significant question remains: how can the gap between the calculation and the results of surveys be resolved, and how can the real time preferences of individuals be interpreted using a social time preference rate. The second part of the paper estimates the social time preference rate for Hungary using the results of the survey, while paying special attention to the pure time preference component. The results suggest that the current method of calculation of the pure time preference rate does not reflect the real attitudes of individuals towards future generations

Bounding Helly numbers via Betti numbers

We show that very weak topological assumptions are enough to ensure the existence of a Helly-type theorem. More precisely, we show that for any non-negative integers $b$ and $d$ there exists an integer $h(b,d)$ such that the following holds. If $\mathcal F$ is a finite family of subsets of $\mathbb R^d$ such that $\tilde\beta_i\left(\bigcap\mathcal G\right) \le b$ for any $\mathcal G \subsetneq \mathcal F$ and every $0 \le i \le \lceil d/2 \rceil-1$ then $\mathcal F$ has Helly number at most $h(b,d)$. Here $\tilde\beta_i$ denotes the reduced $\mathbb Z_2$-Betti numbers (with singular homology). These topological conditions are sharp: not controlling any of these $\lceil d/2 \rceil$ first Betti numbers allow for families with unbounded Helly number. Our proofs combine homological non-embeddability results with a Ramsey-based approach to build, given an arbitrary simplicial complex $K$, some well-behaved chain map $C_*(K) \to C_*(\mathbb R^d)$.Comment: 29 pages, 8 figure

A local 2-approximation algorithm for the vertex cover problem

We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (Δ + 1)2 synchronous communication rounds, where Δ is the maximum degree of the graph. For Δ = 3, we give a 2-approximation algorithm also for the weighted version of the problem.Peer reviewe

Science-Technology-Society (STS): a new paradigm in Science Education

publication-status: Publishedtypes: ArticleChanges in the past two decades of goals for science education in schools have induced new orientations in science education worldwide. One of the emerging complementary approaches was the science-technology-society (STS) movement. STS has been called the current megatrend in science education. Others have called it a paradigm shift for the field of science education. The success of science education reform depends on teachers' ability to integrate the philosophy and practices of current programs of science education reform with their existing philosophy. Thus, when considering the STS approach to science education, teacher beliefs about STS implementation require attention. Without this attention, negative beliefs concerning STS implementation and inquiry learning could defeat the reform movements emphasizing STS. This article argues the role of STS in science education and the importance of considering science teachers' beliefs about STS in implementing significant reforms in science education