Formally verifying infinite-state systems can be a daunting task, especially when it comes to
reasoning about quantifiers. In particular, quantifier alternations in conjunction with function …

Propositional Gödel logic G extends intuitionistic logic with the non-constructive principle of
linearity (A→ B)∨(B→ A). We introduce a Curry-Howard correspondence for G and show …

Abstract qPCF is a paradigmatic quantum programming language that extends PCF with
quantum circuits and a quantum co-processor. Quantum circuits are treated as classical data …

Along the lines of Abramsky's “Proofs-as-Processes” program, we present an interpretation
of multiplicative linear logic as typing system for concurrent functional programming. In …

We present IQu, namely a quantum programming language that extends Reynold's
Idealized Algol, the paradigmatic core of Algol-like languages. IQu combines imperative …

Dummett's logic LC is intuitionistic logic extended with Dummett's axiom: for every two
statements the first implies the second or the second implies the first. We present a natural …

Meteorological forecasting is the process of providing reliable prediction about the future
weathear within a given interval of time. Forecasters adopt a model of reasoning that can be …

Herbrand's theorem is one of the most fundamental insights in logic. From the syntactic point
of view, it suggests a compact representation of proofs in classical first-and higher-order …

We present abstract complexity results about Coquand and Hyland–Ong game semantics,
that will lead to new bounds on the length of first-order cut-elimination, normalization …

Sažetak Diagnostic tests are used to determine anomalies in complex systems such as
organisms or built structures. Once a set of tests is performed, the experts interpret their …