Deduction of Freedom vs Deduction of Experience in Kant’s Metaphysics

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the washback effect of discretepoint vs. integrative tests on the retention of content in knowledge tests

در این پایان نامه تاثیر دو نوع تست جزیی نگر و کلی نگر بر به یادسپاری محتوا ارزیابی شده که نتایج نشان دهندهکارایی تستهای کلی نگر بیشتر از سایر آزمونها است

15 صفحه اول

Automated Deduction in the B Set Theory using Deduction Modulo

We introduce a new encoding of the set theory of the B method based on deduction modulo. The theory of deduction modulo is an extension of predicate calculus that includes rewriting on both terms and propositions, which is well suited for proof search in axiomatic theories, as it turns many axioms into rewrite rules. We also present Zenon Modulo and iProver Modulo, two automated theorem provers...

متن کامل

Future directions of automated deduction: Distributed automated deduction

Distributed automated deduction is concerned with the design and realization of strategies where multiple deductive processes work concurrently towards the solution of theorem-proving problems. These strategies are usually implemented in distributed environments, such as a network of computers, or a loosely coupled, asynchronous multiprocessor, where each deductive process runs on a node of the...

متن کامل

Normalization in Supernatural deduction and in Deduction modulo

Deduction modulo and Supernatural deduction are two extentions of predicate logic with computation rules. Whereas the application of computation rules in deduction modulo is transparent, these rules are used to build non-logical deduction rules in Supernatural deduction. In both cases, adding computation rules may jeopardize proof normalization, but various conditions have been given in both ca...

متن کامل

Machine Deduction

We present in this paper a new type system which allows to extract code for an abstract machine instead of lambda-terms. Thus, we get a framework to compile correctly programs extracted from proof by translating their proof in our system and then extracting the code. Moreover, we will see that we can associate programs to classical proofs.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Kantian journal

سال: 2019

ISSN: 2310-3701,0207-6918

DOI: 10.5922/0207-6918-2019-1-3