Category:Logic in computer science

From Wikipedia, the free encyclopedia

Logic in computer science is that branch of mathematical logic which is approximately the intersection between mathematical logic and computer science. It contains:

1. Those investigations into logic that are guided by applications in computer science. For example:
   • Combinatory logic and Abstract interpretation;
2. Fundamental concepts in computer science that are naturally expressible in logical form. For example:
   • Formal semantics of programming languages, Hoare logic, and Logic programming;
3. Applications of fundamental concepts derived from the theory of computation that cast light on questions of pure logic. For example:
   • Curry-Howard correspondence and Game semantics;
4. Tools for logicians considered as applied computer science. For example:
   • Automated theorem proving and Model checking.

The main article for this category is Logic in computer science.

Subcategories

This category has the following 11 subcategories, out of 11 total.

A Automated theorem proving C Categorical logic D Denotational semantics

D cont. Descriptive complexity F Formal methods G Logic gates L Lambda calculus

L cont. Logic programming Logical calculi T Type theory Z Z notation

Pages in category "Logic in computer science"

The following 66 pages are in this category, out of 66 total. Updates to this list can occasionally be delayed for a few days.

Logic in computer science A Abstract interpretation Abstraction model checking Algebraic semantics Assertion (computing) Axiomatic semantics B Backward chaining Bisimulation Boolean satisfiability problem Bunched logic C Circuit minimization Combinatory logic Computational tree logic Corresponding conditional (logic) Curry-Howard correspondence D Denotational semantics Duration calculus Dynamic logic (modal logic) E Event calculus F Fair Computational tree logic Fluent (artificial intelligence) Formal semantics of programming languages

F cont. Formal verification Forward chaining Fuzzy logic G Game semantics Geometry of interaction H Hazard (logic) Herbrand Award Hoare logic Horn clause Horn-satisfiability I Intuitionistic logic Intuitionistic type theory K Karnaugh map L LCF (theorem prover) LF (logical framework) M Maximum satisfiability problem Model checking Model elimination N Normalization property (lambda-calculus) O OBJ Operational semantics Ordered Weighted Averaging (OWA) Aggregation Operators P Partial order reduction

P cont. Postcondition Precondition Predicate transformer semantics Preferential entailment Presburger arithmetic Probabilistic CTL R Race condition Rewriting Runtime verification S Satisfiability Modulo Theories Separation logic Star-free language Structural induction Sufficiently connected T Twelf Typed lambda calculus U Unit propagation W WalkSAT Weakest liberal precondition Weakest precondition Λ ΛProlog

Categories: Mathematical logic | Theoretical computer science | Mathematics of computing

Views

• Category
• Discussion
• Current revision

Navigation

• Main Page
• Contents
• Featured content
• Current events

Interaction

• About Wikipedia
• Community portal
• Recent changes
• Contact Wikipedia
• Donate to Wikipedia
• Help

Search

Languages

• Esperanto
• ‪Norsk (nynorsk)‬
• 中文

• This page was last modified 12:11, 9 May 2008 by Wikipedia user BepBot. Based on work by Wikipedia user(s) Mikkalai, Jpbowen, Pegship, Escarbot, Michael Snow, Pce3@ij.net, Allan McInnes, Mhss en, Ruud Koot, Chalst, Isaac Rabinovitch and Ancheta Wis.
• All text is available under the terms of the GNU Free Documentation License. (See Copyrights for details.)
  Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc., a U.S. registered 501(c)(3) tax-deductible nonprofit charity.
  
• About Wikipedia
• Disclaimers

aa - ab - af - ak - als - am - an - ang - ar - arc - as - ast - av - ay - az - ba - bar - bat_smg - bcl - be - be_x_old - bg - bh - bi - bm - bn - bo - bpy - br - bs - bug - bxr - ca - cbk_zam - cdo - ce - ceb - ch - cho - chr - chy - co - cr - crh - cs - csb - cu - cv - cy - da - de - diq - dsb - dv - dz - ee - el - eml - en - eo - es - et - eu - ext - fa - ff - fi - fiu_vro - fj - fo - fr - frp - fur - fy - ga - gan - gd - gl - glk - gn - got - gu - gv - ha - hak - haw - he - hi - hif - ho - hr - hsb - ht - hu - hy - hz - ia - id - ie - ig - ii - ik - ilo - io - is - it - iu - ja - jbo - jv - ka - kaa - kab - kg - ki - kj - kk - kl - km - kn - ko - kr - ks - ksh - ku - kv - kw - ky - la - lad - lb - lbe - lg - li - lij - lmo - ln - lo - lt - lv - map_bms - mdf - mg - mh - mi - mk - ml - mn - mo - mr - mt - mus - my - myv - mzn - na - nah - nap - nds - nds_nl - ne - new - ng - nl - nn - no - nov - nrm - nv - ny - oc - om - or - os - pa - pag - pam - pap - pdc - pi - pih - pl - pms - ps - pt - qu - quality - rm - rmy - rn - ro - roa_rup - roa_tara - ru - rw - sa - sah - sc - scn - sco - sd - se - sg - sh - si - simple - sk - sl - sm - sn - so - sr - srn - ss - st - stq - su - sv - sw - szl - ta - te - tet - tg - th - ti - tk - tl - tlh - tn - to - tpi - tr - ts - tt - tum - tw - ty - udm - ug - uk - ur - uz - ve - vec - vi - vls - vo - wa - war - wo - wuu - xal - xh - yi - yo - za - zea - zh - zh_classical - zh_min_nan - zh_yue - zu -