Results 11 to 20 of about 23,486 (260)
Completeness for the Classical Antecedent Fragment of Inquisitive First-Order Logic [PDF]
AbstractInquisitive first order logic "Equation missing" is an extension of first order classical logic, introducing questions and studying the logical relations between questions and quantifiers. It is not known whether "Equation missing" is recursively axiomatizable, even though an axiomatization has been found for fragments of the logic (Ciardelli ...
Gianluca Grilletti
openaire +5 more sources
A herbrandized functional interpretation of classical first-order logic [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fernando Ferreira, Gilda Ferreira
openaire +4 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
ASCHIERI, Federico, ZORZI, Margherita
openaire +4 more sources
An Arithmetically Complete Predicate Modal Logic
This paper investigates a first-order extension of GL called \(\textup{ML}^3\). We outline briefly the history that led to \(\textup{ML}^3\), its key properties and some of its toolbox: the \emph{conservation theorem}, its cut-free Gentzenisation, the ...
Yunge Hao, George Tourlakis
doaj +1 more source
A comparative study of the position of ethics in the law of obligations in the legal system of Iran and France [PDF]
The relationship between ethics and law has long been a point of contention between jurists and philosophers. In general, there are two views, classical and modern; The first view implies that there is a fundamental difference between these two branches ...
Mostafa Harati
doaj +1 more source
Duality Theory and Categorical Universal Logic: With Emphasis on Quantum Structures [PDF]
Categorical Universal Logic is a theory of monad-relativised hyperdoctrines (or fibred universal algebras), which in particular encompasses categorical forms of both first-order and higher-order quantum logics as well as classical, intuitionistic, and ...
Yoshihiro Maruyama
doaj +1 more source
Cut Elimination for Extended Sequent Calculi
We present a syntactical cut-elimination proof for an extended sequent calculus covering the classical modal logics in the \(\mathsf{K}\), \(\mathsf{D}\), \(\mathsf{T}\), \(\mathsf{K4}\), \(\mathsf{D4}\) and \(\mathsf{S4}\) spectrum.
Simone Martini +2 more
doaj +1 more source
On the Succinctness of Atoms of Dependency [PDF]
Propositional team logic is the propositional analog to first-order team logic. Non-classical atoms of dependence, independence, inclusion, exclusion and anonymity can be expressed in it, but for all atoms except dependence only exponential translations ...
Martin Lück, Miikka Vilander
doaj +1 more source
On the system CL12 of computability logic [PDF]
Computability logic (see http://www.csc.villanova.edu/~japaridz/CL/) is a long-term project for redeveloping logic on the basis of a constructive game semantics, with games seen as abstract models of interactive computational problems.
Giorgi Japaridze
doaj +1 more source
Typed realizability for first-order classical analysis [PDF]
We describe a realizability framework for classical first-order logic in which realizers live in (a model of) typed {\lambda}{\mu}-calculus.
Valentin Blot
doaj +1 more source

