相关论文: Are there Hilbert-style Pure Type Systems?

In previous work [Lewitzka, Log. J. IGPL 2017], we presented a hierarchy of classical modal systems, along with algebraic semantics, for the reasoning about intuitionistic truth, belief and knowledge. Deviating from G\"odel's interpretation…

System I is a proof language for a fragment of propositional logic where isomorphic propositions, such as $A\wedge B$ and $B\wedge A$, or $A\Rightarrow(B\wedge C)$ and $(A\Rightarrow B)\wedge(A\Rightarrow C)$ are made equal. System I enjoys…

In this paper, we study logics of dependence on the propositional level. We prove that several interesting propositional logics of dependence, including propositional dependence logic, propositional intuitionistic dependence logic as well…

The theory of product systems both of Hilbert spaces (Arveson systems) and product systems of Hilbert modules has reached a status where it seems appropriate to rest a moment and to have a look at what is known so far and what are open…

Intersection types are an essential tool in the analysis of operational and denotational properties of lambda-terms and functional programs. Among them, non-idempotent intersection types provide precise quantitative information about the…

We present two logical systems based on dependent types that are comparable to ZFC, both in terms of simplicity and having natural set theoretic interpretations. Our perspective is that of a mathematician trained in classical logic, but…

In this paper we show several similarities among logic systems that deal simultaneously with deductive and quantitative inference. We claim it is appropriate to call the tasks those systems perform as Quantitative Logic Reasoning. Analogous…

Superintegrable systems are classical and quantum Hamiltonian systems which enjoy much symmetry and structure that permit their solubility via analytic and even, algebraic means. They include such well-known and important models as the…

We show that propositional logic and its extensions can support answer-set programming in the same way stable logic programming and disjunctive logic programming do. To this end, we introduce a logic based on the logic of propositional…

We design a proof system for propositional classical logic that integrates two languages for Boolean functions: standard conjunction-disjunction-negation and binary decision trees. We give two reasons to do so. The first is…

The semantics of determiner phrases, be they definite de- scriptions, indefinite descriptions or quantified noun phrases, is often as- sumed to be a fully solved question: common nouns are properties, and determiners are generalised…

Holliday recently introduced a non-classical logic called Fundamental Logic, which intends to capture exactly those properties of the connectives "and", "or" and "not" that hold in virtue of their introduction and elimination rules in…

We study point modules of monomial algebras associated with symbolic dynamical systems, parametrized by proalgebraic varieties which 'linearize' the underlying dynamical systems. Faithful point modules correspond to transitive sub-systems,…

We define a logical framework with singleton types and one universe of small types. We give the semantics using a PER model; it is used for constructing a normalisation-by-evaluation algorithm. We prove completeness and soundness of the…

We revisit the notion of intuitionistic equivalence and formal proof representations by adopting the view of formulas as exponential polynomials. After observing that most of the invertible proof rules of intuitionistic (minimal)…

We present the logic iJT4, which is an explicit version of intuitionistic S4 and establish soundness and completeness with respect to modular models.

Proof-theoretic semantics (PTS) is normally understood today as Base-Extension Semantics (B-eS), i.e., as a theory of proof-theoretic consequence over atomic proof systems. Intuitionistic logic (IL) has been proved to be incomplete over a…

Algebraic datatypes, and among them lists and trees, have attracted a lot of interest in automated reasoning and Satisfiability Modulo Theories (SMT). Since its latest stable version, the SMT-LIB standard defines a theory of algebraic…

In a case study we investigate whether off the shelf higher-order theorem provers and model generators can be employed to automate reasoning in and about quantified multimodal logics. In our experiments we exploit the new TPTP…

This paper describes an axiomatic theory BT for constructive mathematics. BT has a predicative comprehension axiom for a countable number of set types and usual combinatorial operations. BT has intuitionistic logic, is consistent with…