Logic
Lesson schedule
Tutor score
positve
feedbacks
Students feedbacks
Tutor information
General information
nick  williamcfritsch 

country  United States 
languages  English, German, Greek, Latin 
contact 

Education
Experience: 0 years
About me
Logic: I have tutored clients in logic for several years. It is important for me to specify the kinds of logic that I tutor  Boolean, Modal, Existential, Quantifier, and Symbolic. These kinds of logic are found in workbooks and textbooks. Clients usually have me work from a book and usually have problems that they can't solve on their own. We work through the problems accordingly.
Symbolic Logic: Symbolic logic is the method of representing logical expressions through the use of symbols and variables, rather than in ordinary language. This has the benefit of removing the ambiguity that normally accompanies ordinary languages, such as English, and allows easier operation. There are many systems of symbolic logic, such as classical propositional logic, firstorder logic and modal logic. Each may have seperate symbols, or exclude the use of certain symbols.
Mathematical Logic: Mathematical logic is a subfield of mathematics exploring the applications of formal logic to mathematics. It bears close connections to metamathematics, the foundations of mathematics, and theoretical computer science.
Modal Logic: Modal logic is a type of formal logic primarily developed in the 1960s that extends classical propositional and predicate logic to include operators expressing modality. A modal—a word that expresses a modality—qualifies a statement.
Predicate calculus: An advanced form of symbolic logic incorporating not only propositions (1), relations between propositions (and, or, not, and if …. Then), axioms, and rules of inference, but also quantifiers (1). Firstorder predicate calculus is obtained by extending propositional calculus to include quantifiers, and it is widely regarded as the most powerful form of symbolic logic.
Propositional calculus: any formal system of symbolic logic providing a language for expressing propositions (1) and the relations between them (and, or, not, and if … then), without regard to the internal structure or content of the propositions, together with a set of axioms and rules of inference, embellishing the process of constructing a valid argument to be reduced to a mechanical process.