We present a novel calculus for reasoning with both indicative and interrogative sentences, simultaneously modeling entailment between indicative sentences, entailment between interrogative sentences and answerhood relations. The logic is based on an interpretation of questions as entities of type t, the type of propositions. This is achieved by an algebraic reinterpretation of the domain of ty...

We propose a unifying method for analysis of scheduling problems in real-time systems. The method is based on ACSR-VP, a real-time process algebra with value-passing capabilities. We use ACSR-VP to describe an instance of a scheduling problem as a process that has parameters of the problem as free variables. The specification is analyzed by means of a symbolic algorithm. The outcome of the anal...

In this proof pearl, we demonstrate the power of higherorder encodings in the logical framework Twelf[PS99] by investigating proofs about an algorithmic specification of bounded subtype polymorphism, a problem from the POPLmark challenge [ABF05]. Our encoding and representation of the problem plays to the strengths of the logical framework LF. Higher-order abstract syntax is used to deal with i...

The equations that define the Lax pairs for generalized principal chiral models can be solved for any nondegenerate bilinear form on su(2). The solution is dependent on one free variable that can serve as the spectral parameter. 1 Formulation of the generalized chiral models Principal chiral models are important example of relativistically invariant field theory integrable by the inverse scatte...

Enzyme costs play a major role in the choice of metabolic routes, both in evolution and bioengineering. Given desired fluxes, necessary enzyme levels can be estimated based on known rate laws and on a principle of minimal enzyme cost. With logarithmic metabolite levels as free variables, enzyme cost functions and constraints in optimality and sampling problems can be handled easily. The set of ...

We give a Natural Deduction formulation of an adaptation of Gödel’s functional (Dialectica) interpretation to the extraction of (more) efficient programs from (classical) proofs. We adapt Jørgensen’s formulation of pure Dialectica translation by eliminating his “Contraction Lemma” and allowing free variables in the extracted terms (which is more suitable in a Natural Deduction setting). We also...

Assume p∗ is a meager type in a superstable theory T . We investigate definability properties of p∗-closure. We prove that if T has < 2א0 countable models then the multiplicity rank M of every type p is finite. We improve Saffe’s conjecture. 0. Introduction. Throughout the paper, T is a superstable theory in a countable language L, and we work within a monster model C = C of T . The general ref...