Results 281 to 290 of about 2,879,484 (330)
Analgesic and sedative drug dosing in critically ill patients with Acute Kidney Injury undergoing different modalities of Kidney Replacement Therapy. [PDF]
Di Mario F +10 more
europepmc +1 more source
This is an exposition of Novikov's cut-elimination procedure for a Hilbert-style formulation of the first-order predicate calculus, which depends on a property of formulas introduced by him, called 'regularity'. A comparison with other methods is outlined.
L. Bellotti
semanticscholar +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Cut-Elimination: Syntax and Semantics
Studia Logica, 2014This article concerns the cut-elimination by resolution (CERES) method for first-order logic [\textit{M. Baaz} et al., Lect. Notes Comput. Sci. 3452, 481--495 (2005; Zbl 1108.03305)]. Compared with reductive cut-elimination (e.g.\ Gentzen-/Schütte-/Tait-style) which can be viewed as sequences of local reductions, CERES operates globally on LK-proofs ...
M. Baaz, A. Leitsch
semanticscholar +2 more sources
IEEE Transactions on Ultrasonics, Ferroelectrics and Frequency Control, 2022
A LiNbO3 (LN)/SiO2/Si multilayered structure was recently reported as a new platform for achieving wideband radio frequency (RF) filters. However, the in-band ripples in filters resulting from the spurious Rayleigh mode lead to deteriorated performance ...
Huiping Xu +9 more
semanticscholar +1 more source
A LiNbO3 (LN)/SiO2/Si multilayered structure was recently reported as a new platform for achieving wideband radio frequency (RF) filters. However, the in-band ripples in filters resulting from the spurious Rayleigh mode lead to deteriorated performance ...
Huiping Xu +9 more
semanticscholar +1 more source
Cut-Elimination for Quantified Conditional Logic
Journal of Philosophical Logic, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christoph Benzmüller
semanticscholar +2 more sources
, 2015
We present methods for removing top-level cuts from a sequent calculus or Tait-style proof without significantly increasing the space used for storing the proof. For propositional logic, this requires converting a proof from tree-like to dag-like form, but at most doubles the number of lines in the proof.
S. Buss
semanticscholar +2 more sources
We present methods for removing top-level cuts from a sequent calculus or Tait-style proof without significantly increasing the space used for storing the proof. For propositional logic, this requires converting a proof from tree-like to dag-like form, but at most doubles the number of lines in the proof.
S. Buss
semanticscholar +2 more sources
CUT ELIMINATION IN HYPERSEQUENT CALCULUS FOR SOME LOGICS OF LINEAR TIME
The Review of Symbolic Logic, 2019This is a sequel article to [10] where a hypersequent calculus (HC) for some temporal logics of linear frames including Kt4.3 and its extensions for dense and serial flow of time was investigated in detail.
Andrzej Indrzejczak
semanticscholar +1 more source

