scientific article; zbMATH DE number 3300566

From MaRDI portal
Revision as of 03:46, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5582304

zbMath0188.31501MaRDI QIDQ5582304

A. C. Leisenring

Publication date: 1969


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (31)

Modeling multi-rate DSP specification semantics for formal transformational design in HOLReadable Formalization of Euler’s Partition Theorem in MizarLogical equations in monadic logicThe epsilon-reconstruction of theories and scientific structuralismNon-determinism in logic-based languagesSemantics of under-determined expressionsAxiomatization of a functional logic languageZenon: An Extensible Automated Theorem Prover Producing Checkable ProofsRAMSIFICATION AND SEMANTIC INDETERMINACYDung's argumentation is essentially equivalent to classical propositional logic with the Peirce-Quine daggerResolution with order and selection for hybrid logicsDenotation, Paradox and Multiple MeaningsHilbert's epsilon as an operator of indefinite committed choiceHarmonising natural deductionR n - and G n -logicsA relational formulation of the theory of typesPrior's individualsExistential instantiation and normalization in sequent natural deductionHilbert's \(\varepsilon{}\)-operator and classical logicA note on a proof of ShepherdsonThe strength of Mac Lane set theoryAckermann's substitution method (remixed)Heyting predicate calculus with epsilon symbolGrounding, quantifiers, and paradoxesSemantics and Proof Theory of the Epsilon CalculusThe theory of Zermelo-Fraenkel sets with Hilbert \(\varepsilon\)-termsNatural Deduction for Equality: The Missing EntityA derived algorithm for evaluating \(\varepsilon\)-expressions over abstract setsChoice and logicTHE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETICThe epsilon calculus and Herbrand complexity







This page was built for publication: