Results 31 to 40 of about 65,097 (137)

Kant on the Logical Form of Singular Judgments [PDF]

open access: yes, 2014
At A71/B96–7 Kant explains that singular judgements are ‘special’ because they stand to the general ones as Einheit to Unendlichkeit. The reference to Einheit brings to mind the category of unity and hence raises a spectre of
Lu-Adler, Huaping
core   +1 more source

Definability of groups in $\aleph_0$-stable metric structures [PDF]

open access: yes, 2009
We prove that in a continuous $\aleph_0$-stable theory every type-definable group is definable. The two main ingredients in the proof are: \begin{enumerate} \item Results concerning Morley ranks (i.e., Cantor-Bendixson ranks) from \cite{BenYaacov ...
Yaacov, Itaï Ben
core   +3 more sources

On Stronger Calculi for QBFs

open access: yes, 2016
Quantified Boolean formulas (QBFs) generalize propositional formulas by admitting quantifications over propositional variables. QBFs can be viewed as (restricted) formulas of first-order predicate logic and easy translations of QBFs into first-order ...
Egly, Uwe
core   +2 more sources

Categorical and algebraic aspects of the intuitionistic modal logic IEL― and its predicate extensions

open access: yesJournal of Logic and Computation, 2020
Abstract The system of intuitionistic modal logic $\textbf{IEL}^{-}$ was proposed by S. Artemov and T. Protopopescu as the intuitionistic version of belief logic (S. Artemov and T. Protopopescu. Intuitionistic epistemic logic. The Review of Symbolic Logic, 9, 266–298, 2016).
openaire   +1 more source

Introducing Quantified Cuts in Logic with Equality

open access: yes, 2014
Cut-introduction is a technique for structuring and compressing formal proofs. In this paper we generalize our cut-introduction method for the introduction of quantified lemmas of the form $\forall x.A$ (for quantifier-free $A$) to a method generating ...
Hetzl, Stefan   +4 more
core   +2 more sources

Practical Theory Extension in Event-B [PDF]

open access: yes, 2013
. The Rodin tool for Event-B supports formal modelling and proof using a mathematical language that is based on predicate logic and set theory. Although Rodin has in-built support for a rich set of operators and proof rules, for some application areas ...
Butler, Michael, Maamria, Issam
core   +1 more source

LoET-E: A Refined Theory for Proving Security Properties of Cryptographic Protocols

open access: yesIEEE Access, 2019
Nowadays, more and more new cryptographic protocols are emerging, and the security analysis of emerging cryptographic protocols is increasingly important.
Jiawen Song   +4 more
doaj   +1 more source

The Negation of Content Participation of the Concept of Existence in Islamic Gnosis and Transcendent Theosophy [PDF]

open access: yesحکمت معاصر, 2013
In science of logic equivocation and content participation has been described on the basis of the literary contractions among men of letters, but Mulla Sadra referring to that philosopher doesn't pay attention to these contractions, explains the two ...
Morteza Shajari, Leila Ghorbani Alvar
doaj  

Offline Specialisation in Prolog Using a Hand-Written Compiler Generator

open access: yes, 2004
The so called "cogen approach" to program specialisation, writing a compiler generator instead of a specialiser, has been used with considerable success in partial evaluation of both functional and imperative languages.
Bruynooghe, Maurice   +3 more
core   +1 more source

A cut-free proof system for a predicate extension of the logic of provability

open access: yesReports on Mathematical Logic, 2018
In this paper, we introduce a proof system $\mathsf{NQGL}$ for a Kripke complete predicate extension of the logic $\mathbf{GL}$, that is, the logic of provability, which is defned by $\mathbf{K}$ and the Löb formula $\Box(\Box p\supset p)\supset\Box p$. $\mathsf{NQGL}$ is a modal extension of Gentzen's sequent calculus $\mathsf{LK}$.
openaire   +3 more sources

Home - About - Disclaimer - Privacy