We prove determinacy for open length ω1 games. Going further we introduce, and prove determinacy for, a stronger class of games of length ω1, with payoff conditions involving the entire run, the club filter on ω1, and a sequence of ω1 disjoint stationary subsets of ω1. The determinacy proofs use an iterable model with a class of indiscernible Woodin cardinals, and we show that the games precise...

We introduce increasing returns to scale into an otherwise standard New Keynesian model with capital, and study the determinacy and E-stability of Taylor-type interest rate rules. With very mild increasing returns supported by empirical research, the conventional wisdom regarding the design of interest rate rules can be overturned. In particular, the “Taylor principle” no longer guarantees eith...

And-parallelism arises in Prolog programs when conjunctive subgoals in a query or the body of a clause are executed in parallel. In this paper we present three optimizations, namely, the last parallel call optimization, the shallow parallelism optimization, and the processor determinacy optimization that take advantage of determinacy to improve eeciency of and-parallel execution of Prolog progr...

Unnecessary backtracking is a principal source of ineeciency in Prolog execution. In order to avoid the overhead of the general backtracking mechanism, determinate programs should be executed deterministically. Achieving this requires an automatic means of extracting de-terminacy. We present a method in which determinacy is inferred from the success conditions and the calling contexts of predic...

One of the most intriguing developments of modern set theory is the investigation of two-player infinite games of perfect information. Of course, it is clear that applied game theory, as any other branch of mathematics, can be modeled in set theory. But we are talking about the converse: the use of infinite games as a tool to study fundamental set theoretic questions. When such infinite games a...

The Sπ-calculus is a synchronous π-calculus which is based on the SL model. Thelatter is a relaxation of the Esterel model where the reaction to the absence of a signalwithin an instant can only happen at the next instant. In the present work, we studythe notions of determinacy and (local) confluence for the Sπ-calculus and we introduce atyping system that guarantees determinacy.

Abstract In this paper, I raise a question concerning the place of ‘Teleology’ in Hegel's system logic and ask whether as logical category can should come immediately before ‘Life’. offer two main reasons to think that might be misplaced. The first indirect reason is inspired by difference between Philosophy Nature immediate precursors emergence life real determinacy. Logic, interposed ‘Chemism...

1 Abstract Equivalents have been established between the determinacy of games played at various intervals of the diierence hierarchy of co-analytical sets, with embeddings of inner models, by the work of Martin. Taken together with a theorem of Harrington, these yield a strictly level-by-level description for most levels. We complete this analysis by establishing suitable equivalences for the r...

In program development it is useful to know that a call to a Prolog program will not inadvertently leave a choice-point on the stack. Determinacy inference has been proposed for solving this problem yet the analysis was found to be wanting in that it could not infer determinacy conditions for programs that contained cuts or applied certain tests to select a clause. This paper shows how to remed...