Correction to a definition of negation

1984 ◽  
Vol 49 (1) ◽  
pp. 47-50 ◽  
Author(s):  
Frederic B. Fitch
Keyword(s):  
Fixed Point ◽  
Personal Communication ◽  
The Other ◽  
Transfinite Induction ◽  
Original Form ◽  
Basic Logic ◽  
Double Negation ◽  
Original Letter ◽  
The Law ◽  
Definition Of

In [3] a definition of negation was presented for the system K′ of extended basic logic [1], but it has since been shown by Peter Päppinghaus (personal communication) that this definition fails to give rise to the law of double negation as I claimed it did. The purpose of this note is to revise this defective definition in such a way that it clearly does give rise to the law of double negation, as well as to the other negation rules of K′.Although Päppinghaus's original letter to me was dated September 19, 1972, the matter has remained unresolved all this time. Only recently have I seen that there is a simple way to correct the definition. I am of course very grateful to Päppinghaus for pointing out my error in claiming to be able to derive the rule of double negation from the original form of the definition.The corrected definition will, as before, use fixed-point operators to give the effect of the required kind of transfinite induction, but this time a double transfinite induction will be used, somewhat like the double transfinite induction used in [5] to define simultaneously the theorems and antitheorems of system CΓ.

Formalization of Transfinite Induction in Coq*

2019 ◽  
Author(s):  
Tianyu Sun ◽  
Wensheng Yu ◽  
Yaoshun Fu
Keyword(s):  
Transfinite Induction

Random mosaics with cells of general topology

1996 ◽  
Vol 28 (02) ◽  
pp. 332
Author(s):  
Richard Cowan ◽  
Albert K. L. Tsang
Keyword(s):  
Euler Characteristic ◽  
Ergodic Theory ◽  
General Topology ◽  
Traditional Theory ◽  
Random Partition ◽  
Random Tessellation ◽  
Random Tessellations ◽  
Partition Process

This paper considers a structure, named a ‘random partition process’, which is a generalisation of a random tessellation. The cells, possibly multi-part and with holes, have a general topology summarised by the Euler characteristic. Vertices of all orders are allowed. Using the tools of ergodic theory, all of the formulae, from the traditional theory of random tessellations with convex cells, are generalised. Some motivating examples are given.

General topology optimization method with continuous and discrete orientation design using isoparametric projection

2014 ◽  
Vol 101 (8) ◽  
pp. 571-605 ◽  
Author(s):  
Tsuyoshi Nomura ◽  
Ercan M. Dede ◽  
Jaewook Lee ◽  
Shintaro Yamasaki ◽  
Tadayoshi Matsumori ◽  
...  
Keyword(s):  
Topology Optimization ◽  
Optimization Method ◽  
General Topology ◽  
Topology Optimization Method
Sign in / Sign up

Export Citation Format

Share Document