logo
logo
x
바코드검색
바코드검색

인기 검색어

실시간 검색어

검색가능 서점

도서목록 제공

Logical Foundations of Computer Science: International Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10-13, 2022, Proceedings

Logical Foundations of Computer Science: International Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10-13, 2022, Proceedings (Paperback)

Anil Nerode, Sergei Artemov (엮은이)
Springer
152,450원

일반도서

검색중
서점 할인가 할인률 배송비 혜택/추가 실질최저가 구매하기
125,000원 -18% 0원
6,250원
118,750원 >
yes24 로딩중
교보문고 로딩중
notice_icon 검색 결과 내에 다른 책이 포함되어 있을 수 있습니다.

중고도서

검색중
서점 유형 등록개수 최저가 구매하기
로딩중

eBook

검색중
서점 정가 할인가 마일리지 실질최저가 구매하기
로딩중

책 이미지

Logical Foundations of Computer Science: International Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10-13, 2022, Proceedings
eBook 미리보기

책 정보

· 제목 : Logical Foundations of Computer Science: International Symposium, LFCS 2022, Deerfield Beach, FL, USA, January 10-13, 2022, Proceedings (Paperback) 
· 분류 : 외국도서 > 과학/수학/생태 > 수학 > 논리
· ISBN : 9783030930998
· 쪽수 : 377쪽
· 출판일 : 2021-12-17

목차

A Non-Hyperarithmetical Godel Logic.- Shorten Resolution Proofs Non-Elementarily.- The Isomorphism Problem for FST Injection Structures.- Justification Logic and Type Theory as Formalizations of Intuitionistic Propositional Logic.- Hyperarithmetical Worm Battles.- Parametric Church’s Thesis: Synthetic Computability Without Choice.- Constructive and Mechanised Meta-Theory of Intuitionistic Epistemic Logic.- A Parametrized Family of Tversky Metrics Connecting the Jaccard Distance to an Analogue of the Normalized Information Distance.- A Parameterized View on the Complexity of Dependence Logic.- A Logic of Interactive Proofs.- Recursive Rules With Aggregation: A Simple Unified Semantics.- Computational Properties of Partial Non-deterministic Matrices and Their Logics.- Soundness and Completeness Results for LEA and Probability Semantics.- On Inverse Operators in Dynamic Epistemic Logic.- Computability Models Over Categories and Presheaves.- Reducts of Relation Algebras: The Aspects of Axiomatisability and Finite Representability.- Between Turing and Kleene.- Propositional Dynamic Logic With Quantification Over Regular Computation Sequences.- Finite Generation and Presentation Problems for Lambda Calculus and Combinatory Logic.- Exact and Parameterized Algorithms for Read-Once Refutations in Horn Constraint Systems.- Logical Principles.- Small Model Property Reflects in Games and Automata.

도서 정보 제공 : Yes24(www.yes24.com), 알라딘(www.aladin.co.kr)

이 포스팅은 쿠팡파트너스 및 제휴마케팅이 포함된 광고로 이에 따른 일정액의 수수료를 제공받습니다.
최근 본 책