1,664 results for logic (0.129 seconds)

arxiv.org/abs/1804.02286v1

Chart Parsing Multimodal Grammars

The short note describes the chart parser for multimodal type-logical grammars which has been developed in conjunction with the type-logical treebank for French. The chart parser presents an incomplete but fast implementation of proof search for mult...

arxiv.org/abs/2010.12223v1

Proof-theoretic aspects of NL$λ$

We present a proof-theoretic analysis of the logic NL$λ$ (Barker \& Shan 2014, Barker 2019). We notably introduce a novel calculus of proof nets and prove it is sound and complete with respect to the sequent calculus for the logic. We study decidabi...

arxiv.org/abs/0711.2444v1

Proof nets for display logic

This paper explores several extensions of proof nets for the Lambek calculus in order to handle the different connectives of display logic in a natural way. The new proof net calculus handles some recent additions to the Lambek vocabulary such as G...

arxiv.org/abs/2008.06351v1

Partial Orders, Residuation, and First-Order Linear Logic

We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent allows us...

arxiv.org/abs/1305.6238v1

Extended Lambek calculi and first-order linear logic

First-order multiplicative intuitionistic linear logic (MILL1) can be seen as an extension of the Lambek calculus. In addition to the fragment of MILL1 which corresponds to the Lambek calculus (of Moot & Piazza 2001), I will show fragments of MILL1 w...

arxiv.org/abs/1902.07741v1

Founded World Views with Autoepistemic Equilibrium Logic

Defined by Gelfond in 1991 (G91), epistemic specifications (or programs) are an extension of logic programming under stable models semantics that introducessubjective literals. A subjective literal al-lows checking whether some regular literal is tru...

arxiv.org/abs/quant-ph/0403079v1

Are all reversible computations tidy?

It has long been known that to minimise the heat emitted by a deterministic computer during it's operation it is necessary to make the computation act in a logically reversible manner\cite{Lan61}. Such logically reversible operations require a numb...

arxiv.org/abs/1511.01181v1

Proceedings 12th International Workshop on Quantum Physics and Logic

This volume contains the proceedings of the 12th International Workshop on Quantum Physics and Logic (QPL 2015), which was held July 15-17, 2015 at Oxford University. The goal of this workshop series is to bring together researchers working on mathem...

arxiv.org/abs/2202.13643v1

Logic Blog 2021

The blog has several entries on group theory interacting with computability and wider logic, several open questions, and an entry on undecidability in physics....

en.wikipedia.org/wiki/Pretzel_Logic

Pretzel Logic - Wikipedia

Pretzel Logic is the third studio album by American rock band Steely Dan, released on February 20, 1974, by ABC Records. It was recorded at the Village

arxiv.org/abs/1212.0079v1

Computing Strong and Weak Permissions in Defeasible Logic

In this paper we propose an extension of Defeasible Logic to represent and compute three concepts of defeasible permission. In particular, we discuss different types of explicit permissive norms that work as exceptions to opposite obligations. Moreov...

arxiv.org/abs/1808.00248v1

Repairing Description Logic Ontologies by Weakening Axioms

The classical approach for repairing a Description Logic ontology O in the sense of removing an unwanted consequence $α$ is to delete a minimal number of axioms from O such that the resulting ontology O' does not have the consequence $α$. However,...