Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')
EuDML - The European Digital Mathematics Library

Login | Register | (Why Register?)

  • Home
  • Advanced Search
  • Browse by Subject
  • Browse by Journals
  • Refs Lookup
  • Subjects
  • 03-XX Mathematical logic and foundations
  • 03Bxx General logic
  • 03B05 Classical propositional logic

03Bxx General logic

  • 03B05 Classical propositional logic
  • 03B10 Classical first-order logic
  • 03B15 Higher-order logic and type theory
  • 03B20 Subsystems of classical logic (including intuitionistic logic)
  • 03B22 Abstract deductive systems
  • 03B25 Decidability of theories and sets of sentences
  • 03B30 Foundations of classical theories (including reverse mathematics)
  • 03B35 Mechanization of proofs and logical operations
  • 03B40 Combinatory logic and lambda-calculus
  • 03B42 Logics of knowledge and belief (including belief change)
  • 03B44 Temporal logic
  • 03B45 Modal logic (including the logic of norms)
  • 03B47 Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics)
  • 03B48 Probability and inductive logic
  • 03B50 Many-valued logic
  • 03B52 Fuzzy logic; logic of vagueness
  • 03B53 Paraconsistent logics
  • 03B55 Intermediate logics
  • 03B60 Other nonclassical logic
  • 03B62 Combined logics
  • 03B65 Logic of natural languages
  • 03B70 Logic in computer science
  • 03B80 Other applications of logic
  • 03B99 None of the above, but in this section
  • Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 1 of 1

Showing per page

Computational complexity of a statistical theoremhood testing procedure for propositional calculus with pseudo-random inputs

Ivan Kramosil (1981)

Kybernetika

Currently displaying 1 – 1 of 1

Page 1

EuDML
  • About EuDML initiative
  • Feedback
  •  version 2.1.7