A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
A New Proof of a Classical Theorem in Design Theory

2001
*
Journal of combinatorial theory. Series A
*

We present

doi:10.1006/jcta.2000.3116
fatcat:tj6idggllbeqhn2ukq67uz452y
*a**new**proof**of*the well known*theorem*on the existence*of*signed (integral) t-*designs*due to Wilson and Graver and Jurkat. ... When applied to*a*constant vector*a*, it results*in**Theorem*1. Later, Wilson published*a*nicer*proof**of*his result*in*[9] . ... By utilizing this basis,*a*flexible algorithm for generating signed*designs*based on the*proof**of*Graver and Jurkat has been presented*in*[4] . ...##
###
Editorial

2000
*
Theoretical Computer Science
*

There is

doi:10.1016/s0304-3975(99)00168-1
fatcat:pw6ussamo5dobmb6ebviodz7gu
*a*long history*of*work*in**proof*-search*in**a*variety*of*systems*of*logic, including*classical*, intuitionistic, relevant, linear and modal systems, at the propositional, ÿrst-and higher-order levels ... Recently, there has been*a*great deal*of*work on*proof*-search*in*type-theoretic lan-0304-3975/00/$ -see front matter c 2000 Elsevier Science B.V. All rights reserved. ... The*design**of*programming languages and*theorem*provers based on linear logic opens*new*implementation challenges not present*in*more traditional languages. ...##
###
Design theory

1989
*
Discrete Mathematics
*

differences
Some more special block

doi:10.1016/0012-365x(89)90278-1
fatcat:7q2q7kduingu7omzvsv6jgzv2a
*designs**Proof**of*Wilson's*Theorem*6.6 VIU. ... An Algebra*of*Statements*Theorems*and Direct*Proofs*Indirect*Proofs*The Natural Numbers Mathematical Induction 2. ...##
###
Page 5422 of Mathematical Reviews Vol. , Issue 87j
[page]

1987
*
Mathematical Reviews
*

Chapter 5 includes

*a**new*section containing topics on perma- nents and the*proof**of*van der Waerden’s conjecture.*In*Chapter 7*a**new**proof**of*P. ...*In*the final section, called Geometric calculus, the authors start*a*program*of*expressing*classical*invariant*theory**in*their language*of*double algebras. ...##
###
Page 2761 of Mathematical Reviews Vol. , Issue 85g
[page]

1985
*
Mathematical Reviews
*

The author gives

*a**new**proof**of*the fact that*a*locally finite*theory*with the amalgamation property has*a*model companion. ...*In*Kozen’s section we find: an equational*theory**of*dynamic algebras,*a**proof*sketch*of*the completeness*of*the Segerberg axioms for PDL,*a*representa- tion*theorem*for separable dynamic algebras, and ...##
###
Page 829 of American Society of Civil Engineers. Collected Journals Vol. 127, Issue 7
[page]

2001
*
American Society of Civil Engineers. Collected Journals
*

The idea

*of*applying the plastic methods*in*situations*of*fire is not*new*. ... After World War II, Baker, Horne, and others at Cambridge Uni- versity continued to establish the plastic*theory*as*a*practical tool*in*steelwork*design*(Heyman 1983). ...##
###
Higher order Fourier analysis of multiplicative functions and applications

2016
*
Journal of The American Mathematical Society
*

It was initiated by

doi:10.1090/jams/857
fatcat:a4g5hq5njbe5letm6wks3b2q6a
*a*seminal paper*of*Gowers [37] on*a**new**proof*for Szemerédi's*theorem*, and has been developed by several mathematicians over the past few decades*in*order to study problems*in*an ... Later Furstenberg [31] developed an ergodic-theoretic framework and gave*a**new**proof*for Szemerédi's*theorem*, but his*proof*was still qualitative. ...##
###
A Single Proof of Classical Behaviour in da Costa's Cn Systems

2015
*
Electronical Notes in Theoretical Computer Science
*

*In*the following paper we present

*a*

*proof*that all logics

*in*the Cn herarchy also behave

*classically*as C 1 . ...

*In*[6] Newton da Costa proved the connectives {→, ∧, ∨, ¬ * }

*in*C 1 satisfy all schemas and inference rules

*of*

*classical*logic. ... Finally,

*a*

*theory*T is explosive if and only if T is trivial

*in*the presence

*of*

*a*contradiction. ...

##
###
Page 4729 of Mathematical Reviews Vol. , Issue 87i
[page]

1987
*
Mathematical Reviews
*

Gentzen’s works for the pure
number

*theory*, G. Takeuti gave consistency*proofs**of*some im- predicative subsystems*of**classical*analysis. ... The first part contains an elegant*proof*, using*a*minimum*of*topos*theory*,*of*the special case*of*Funayama’s*theorem*which the author needs for his application. ...##
###
Page 3039 of Mathematical Reviews Vol. , Issue 89F
[page]

1989
*
Mathematical Reviews
*

This leads to

*a*short and very elegant*proof**of*the*theorem*. Laurent Habsieger (Montreal, PQ) 89f:05023 05A99 26B10 Labelle, Gilbert (3-PQ) Some*new*computational methods*in*the*theory**of*species. ... Finally*a**new**proof**of*an old*theorem*concerning the case n = 4*of*M. Lotan [Amer. Math. Monthly 56 (1949), 535-541; MR 11, 306] and Z. ...##
###
Basic proof theory

1998
*
Science of Computer Programming
*

*In*fact, Herbrand initiated

*a*more general

*proof*

*theory*-with

*a*kind

*of*cut elimination combined with normal form expansion. ... The book is carefully organized, and it provides

*a*compact overview

*of*various trends

*in*"descriptive"

*proof*

*theory*. ...

##
###
Page 334 of Mathematical Reviews Vol. , Issue 99a
[page]

1991
*
Mathematical Reviews
*

some respects

*a*significant improvement on the*classical**theorem*—if equality*in*the*classical*...*In*Chapter 3, the emphasis is on refinements*of**classical**theorems**in*nonlinear analysis, as well as*new*types*of*results, obtain- able with the help*of*nonsmooth analysis. ...##
###
Two remarks on affine designs with classical parameters

1985
*
Journal of combinatorial theory. Series A
*

Simple

doi:10.1016/0097-3165(85)90031-7
fatcat:ej546kvm2febjkx34jysqw27ue
*proofs*are given for Dembowski's*theorem*characterizing the*classical*atline*designs*and for the existence*of*afflne*designs*with*classical*parameters but not isomorphic to any afIine space. ( ... Note added*in**proof*Using symmetric nets, one may*in*fact show that the number*of*afiine*designs*with*classical*parameters grows exponentially. ... Mavron for providing them with useful information relevant to the problem*of*constructing non-isomorphic afiine*designs*with*classical*parameters. ...##
###
Saturation-based theorem proving: Past successes and future potential
[chapter]

1996
*
Lecture Notes in Computer Science
*

Used with permission. 121
ABSFOL:

doi:10.1007/3-540-61511-3_64
fatcat:iizfu32trnfadmj4z7xcvwds5y
*a**proof*checker with abstraction p. 136 SPASS and FLOTTER version 0.42 p. 141 The*design**of*the CADE-13 ATP system competition p. 146 SCAN -Elimination*of*predicate ... combinations*of**theories*p. 463 Ground resolution with group computations on semantic symmetries p. 478*A**new*method for knowledge compilation: the achievement by cycle search p. 493 Rewrite ...##
###
Comparison of Two Theorem Provers: Isabelle/HOL and Coq
[article]

2018
*
arXiv
*
pre-print

features

arXiv:1808.09701v2
fatcat:ffesxt4esffgjottsxmwjykjri
*of*the selected*theorem*provers with support*of*illustrative*proof*examples. ... time, it gave rise to rather practical areas*of*logic, such as the*theory**of*automated*theorem*proving. ... Stavros Tripakis for letting me dive into the exciting world*of*Logic, for providing feedback on my paper at all stages*of*the work, for answering all my countless questions and supporting me. ...
« Previous

*Showing results 1 — 15 out of 121,108 results*