Srećko Kovač

Aristotelian causal theories incorporate some philosophically important features of the concept of cause, including necessity and essential character. The proposed formalization is restricted to one-place predicates and a finite domain of attributes (without individuals). Semantics is based on a labeled tree structure, with truth defined by means of tree paths. A relatively simple causal prefixing mechanism is defined, by means of which causes of propositions and reasoning with causes are made explicit. The distinction of causal and factual explanation are elaborated, and examples of cyclic and convergent causation are given. Soundness and completeness proofs are sketched.

Gödel's philosophical views were to a significant extent influenced by the study not only of Leibniz or Husserl, but also of Kant. Both Gödel and Kant aimed at the secure foundation of philosophy, the certainty of knowledge and the solvability of all meaningful problems in philosophy. In this paper, parallelisms between the foundational crisis of metaphysics in Kant's view and the foundational crisis of mathematics in Gödel's view are elaborated, especially regarding the problem of finding the “secure path of a science” for both mathematics and philosophy. Gödel's temporal subjectivism and metaphysical conceptual objectivism are presented as positively or negatively motivated by Kant's viewpoints. A remark on Gödel's collapse of modalities (in accordance with the collapse of objective time) is added.

On the ground of Kant’s reformulation of the principle of con- tradiction, a non-classical logic KC and its extension KC+ are constructed. In KC and KC+, \neg(\phi \wedge \neg\phi), \phi \rightarrow (\neg\phi \rightarrow \phi), and \phi \vee \neg\phi are not valid due to specific changes in the meaning of connectives and quantifiers, although there is the explosion of derivable consequences from {\phi, ¬\phi} (the deduc- tion theorem lacking). KC and KC+ are interpreted as fragments of an S5-based first-order modal logic M. The quantification in M is combined with a “subject abstraction” device, which excepts predicate letters from the scope of modal operators. Derivability is defined by an appropriate labelled tableau system rules. Informally, KC is mainly ontologically motivated (in contrast, for example, to Jaśkowski’s discussive logic), relativizing state of affairs with respect to conditions such as time.