Results 41 to 50 of about 209,396 (188)
Mapping-equivalence and oid-equivalence of single-function object-creating conjunctive queries
, 2016 Conjunctive database queries have been extended with a mechanism for object creation to capture important applications such as data exchange, data integration, and ontology-based data access. Object creation generates new object identifiers in the result,
Bonifati, Angela +3 more
core +2 more sources
A logical basis for constructive systems
, 2011 The work is devoted to Computability Logic (CoL) -- the philosophical/mathematical platform and long-term project for redeveloping classical logic after replacing truth} by computability in its underlying semantics (see http://www.cis.upenn.edu/~giorgi ...
Japaridze, Giorgi
core +1 more source
A Critical Remark on the BHK Interpretation of Implication
Philosophia Scientiæ, 2014 The BHK interpretation of logical constants is analyzed in terms of a systematic account given by Prawitz, resulting in a reformulation of the BHK interpretation in which the assertability of atomic propositions is determined by Post systems. It is shown
Wagner de Campos Sanz, Thomas Piecha
doaj +1 more source
The Problem of Logical Constants
The Bulletin of Symbolic Logic, 2002 AbstractThere have been several different and even opposed conceptions of the problem of logical constants, i.e., of the requirements that a good theory of logical constants ought to satisfy. This paper is in the first place a survey of these conceptions and a critique of the theories they have given rise to. A second aim of the paper is to sketch some
openaire +2 more sources
Bulletin of the Section of Logic, 2023 Proof-theoretic semantics (P-tS) is the paradigm of semantics in which meaning in logic is based on proof (as opposed to truth). A particular instance of P-tS for intuitionistic propositional logic (IPL) is its base-extension semantics (B-eS).
Alexander V. Gheorghiu, David J. Pym
doaj +1 more source
Extensional Collapse Situations I: non-termination and unrecoverable errors [PDF]
, 2010 We consider a simple model of higher order, functional computation over the booleans. Then, we enrich the model in order to encompass non-termination and unrecoverable errors, taken separately or jointly. We show that the models so defined form a lattice
Bucciarelli, Antonio
core +3 more sources
Chinese Research on Mathematical Logic and the Foundations of Mathematics
Asian Studies, 2022 This paper outlines the Chinese research on mathematical logic and the foundations of mathematics. Firstly, it presents the introduction and spread of mathematical logic in China, especially the teaching and translation of mathematical logic initiated ...
Hongguang Wang, Guoping Du
doaj +1 more source
Perspectives hétérodoxes de Russell sur la question des fondements
Philosophia Scientiæ, 2005 Russell’s logicism consists of a thesis stating that all pure mathematics can be expressed in terms of logical constants and variables. It is usually assumed to be a reduction of pure mathematics to logic.
Anne-Françoise Schmid
doaj +1 more source
Logical strength of complexity theory and a formalization of the PCP theorem in bounded arithmetic
, 2015 We present several known formalizations of theorems from computational complexity in bounded arithmetic and formalize the PCP theorem in the theory PV1 (no formalization of this theorem was known).
Pich, Ján
core +1 more source
Scientific Reports, 2022 The cell division cycle is regulated by a complex network of interacting genes and proteins. The control system has been modeled in many ways, from qualitative Boolean switching-networks to quantitative differential equations and highly detailed ...
Teeraphan Laomettachit +2 more
doaj +1 more source