default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmil Jerábek
Person information
- affiliation: Czech Academy of Sciences, Institute of Mathematics, Czech Republic
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i27]Emil Jerábek:
On the theory of exponential integer parts. CoRR abs/2404.06888 (2024)- [i26]Emil Jerábek:
A note on the theory of well orders. CoRR abs/2405.05779 (2024) - 2023
- [j44]Emil Jerábek
:
On the proof complexity of logics of bounded branching. Ann. Pure Appl. Log. 174(1): 103181 (2023) - [j43]Emil Jerábek:
Elementary analytic functions in VTC0. Ann. Pure Appl. Log. 174(6): 103269 (2023) - [j42]Emil Jerábek:
Models of VTC 0 $\mathsf {VTC^0}$ as exponential integer parts. Math. Log. Q. 69(2): 244-260 (2023) - [i25]Emil Jerábek:
A simplified lower bound for implicational logic. CoRR abs/2303.15090 (2023) - [i24]Emil Jerábek:
A note on the complexity of addition. CoRR abs/2306.08513 (2023) - 2022
- [j41]Emil Jerábek:
Iterated multiplication in VTC 0. Arch. Math. Log. 61(5-6): 705-767 (2022) - [j40]Emil Jerábek:
The theory of hereditarily bounded sets. Math. Log. Q. 68(2): 243-256 (2022) - [i23]Emil Jerábek:
Elementary analytic functions in VTC0. CoRR abs/2206.12164 (2022) - [i22]Emil Jerábek:
Models of VTC0 as exponential integer parts. CoRR abs/2209.01197 (2022) - 2021
- [j39]Emil Jerábek:
On the Complexity of the Clone Membership Problem. Theory Comput. Syst. 65(5): 839-868 (2021) - [i21]Emil Jerábek:
The theory of hereditarily bounded sets. CoRR abs/2104.06932 (2021) - 2020
- [j38]Emil Jerábek:
Induction rules in bounded arithmetic. Arch. Math. Log. 59(3-4): 461-501 (2020) - [j37]Emil Jerábek:
Rules with parameters in modal logic II. Ann. Pure Appl. Log. 171(10): 102829 (2020) - [j36]Emil Jerábek:
Recursive functions and existentially closed structures. J. Math. Log. 20(1): 2050002 (2020) - [i20]Emil Jerábek:
On the proof complexity of logics of bounded branching. CoRR abs/2004.11282 (2020) - [i19]Emil Jerábek:
Iterated multiplication in VTC0. CoRR abs/2011.03095 (2020)
2010 – 2019
- 2019
- [j35]Emil Jerábek:
Rigid models of Presburger arithmetic. Math. Log. Q. 65(1): 108-115 (2019) - [i18]Emil Jerábek:
Rules with parameters in modal logic II. CoRR abs/1905.13157 (2019) - [i17]Emil Jerábek:
On the complexity of the clone membership problem. CoRR abs/1909.12211 (2019) - 2018
- [i16]Emil Jerábek:
Rigid models of Presburger arithmetic. CoRR abs/1803.05797 (2018) - [i15]Emil Jerábek:
Induction rules in bounded arithmetic. CoRR abs/1809.10718 (2018) - 2017
- [j34]Emil Jerábek:
Proof complexity of intuitionistic implicational formulas. Ann. Pure Appl. Log. 168(1): 150-190 (2017) - [i14]Emil Jerábek:
Recursive functions and existentially closed structures. CoRR abs/1710.09864 (2017) - 2016
- [j33]Emil Jerábek:
Division by zero. Arch. Math. Log. 55(7-8): 997-1013 (2016) - [j32]Emil Jerábek:
Integer factoring and modular square roots. J. Comput. Syst. Sci. 82(2): 380-394 (2016) - [j31]Emil Jerábek:
A note on the substructural hierarchy. Math. Log. Q. 62(1-2): 102-110 (2016) - [j30]Emil Jerábek:
Cluster expansion and the boxdot conjecture. Math. Log. Q. 62(6): 608-614 (2016) - [i13]Emil Jerábek:
Division by zero. CoRR abs/1604.07309 (2016) - [i12]Emil Jerábek:
Galois connection for multiple-output operations. CoRR abs/1612.04353 (2016) - 2015
- [j29]Emil Jerábek:
Open induction in a bounded arithmetic for TC0. Arch. Math. Log. 54(3-4): 359-394 (2015) - [j28]Emil Jerábek:
Rules with parameters in modal logic I. Ann. Pure Appl. Log. 166(9): 881-933 (2015) - [j27]Emil Jerábek:
Blending margins: the modal logic K has nullary unification type. J. Log. Comput. 25(5): 1231-1240 (2015) - [e1]Martin Aher, Daniel Hole, Emil Jerábek, Clemens Kupke:
Logic, Language, and Computation - 10th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2013, Gudauri, Georgia, September 23-27, 2013. Revised Selected Papers. Lecture Notes in Computer Science 8984, Springer 2015, ISBN 978-3-662-46905-7 [contents] - [i11]Emil Jerábek:
A note on the substructural hierarchy. CoRR abs/1507.00700 (2015) - [i10]Emil Jerábek:
Proof complexity of intuitionistic implicational formulas. CoRR abs/1512.05667 (2015) - 2014
- [i9]Emil Jerábek:
Open induction in a bounded arithmetic for TC^0. CoRR abs/1404.7435 (2014) - 2013
- [j26]Emil Jerábek, Leszek Aleksander Kolodziejczyk:
Real closures of models of weak arithmetic. Arch. Math. Log. 52(1-2): 143-157 (2013) - [j25]Emil Jerábek:
The complexity of admissible rules of Łukasiewicz logic. J. Log. Comput. 23(3): 693-705 (2013) - [i8]Emil Jerábek:
Rules with parameters in modal logic I. CoRR abs/1305.4912 (2013) - [i7]Emil Jerábek:
Cluster expansion and the boxdot conjecture. CoRR abs/1308.0994 (2013) - 2012
- [j24]Emil Jerábek:
Proofs with monotone cuts. Math. Log. Q. 58(3): 177-187 (2012) - [j23]Emil Jerábek:
Sequence encoding without induction. Math. Log. Q. 58(3): 244-248 (2012) - [j22]Emil Jerábek:
The Ubiquity of conservative Translations. Rev. Symb. Log. 5(4): 666-678 (2012) - [j21]Emil Jerábek:
Root finding with threshold circuits. Theor. Comput. Sci. 462: 59-69 (2012) - [i6]Emil Jerábek:
Sequence encoding without induction. CoRR abs/1201.5835 (2012) - [i5]Emil Jerábek:
Integer factoring and modular square roots. CoRR abs/1207.5220 (2012) - 2011
- [j20]Emil Jerábek:
On theories of bounded arithmetic for NC1. Ann. Pure Appl. Log. 162(4): 322-340 (2011) - [j19]Emil Jerábek:
A sorting network in bounded arithmetic. Ann. Pure Appl. Log. 162(4): 341-355 (2011) - [j18]Emil Jerábek, Phuong Nguyen:
Simulating non-prenex cuts in quantified propositional calculus. Math. Log. Q. 57(5): 524-532 (2011) - [i4]Emil Jerábek:
Blending margins. CoRR abs/1108.6240 (2011) - [i3]Emil Jerábek:
The complexity of admissible rules of Lukasiewicz logic. CoRR abs/1108.6261 (2011) - [i2]Emil Jerábek:
The ubiquity of conservative translations. CoRR abs/1108.6263 (2011) - [i1]Emil Jerábek:
Root finding with threshold circuits. CoRR abs/1112.3925 (2011) - 2010
- [j17]Emil Jerábek:
Admissible Rules of Lukasiewicz Logic. J. Log. Comput. 20(2): 425-447 (2010) - [j16]Emil Jerábek:
Bases of Admissible Rules of Lukasiewicz Logic. J. Log. Comput. 20(6): 1149-1163 (2010) - [j15]Emil Jerábek:
Abelian groups and quadratic residues in weak arithmetic. Math. Log. Q. 56(3): 262-278 (2010)
2000 – 2009
- 2009
- [j14]Emil Jerábek:
Substitution Frege and extended Frege proof systems in non-classical logics. Ann. Pure Appl. Log. 159(1-2): 1-48 (2009) - [j13]Emil Jerábek:
Approximate counting by hashing in bounded arithmetic. J. Symb. Log. 74(3): 829-860 (2009) - [j12]Emil Jerábek:
Canonical rules. J. Symb. Log. 74(4): 1171-1205 (2009) - [j11]Emil Jerábek:
Proof Complexity of the Cut-free Calculus of Structures. J. Log. Comput. 19(2): 323-339 (2009) - 2008
- [j10]Emil Jerábek:
Independent Bases of Admissible Rules. Log. J. IGPL 16(3): 249-267 (2008) - 2007
- [j9]Emil Jerábek:
Complexity of admissible rules. Arch. Math. Log. 46(2): 73-92 (2007) - [j8]Michal Rössler, Emil Jerábek:
Fragment of Nonstandard Analysis with a Finitary Consistency Proof. Bull. Symb. Log. 13(1): 54-70 (2007) - [j7]Emil Jerábek:
Approximate counting in bounded arithmetic. J. Symb. Log. 72(3): 959-993 (2007) - [j6]Emil Jerábek:
On Independence of Variants of the Weak Pigeonhole Principle. J. Log. Comput. 17(3): 587-604 (2007) - 2006
- [j5]Emil Jerábek:
Frege systems for extensible modal logics. Ann. Pure Appl. Log. 142(1-3): 366-379 (2006) - [j4]Emil Jerábek:
The strength of sharply bounded induction. Math. Log. Q. 52(6): 613-624 (2006) - 2005
- [j3]Emil Jerábek:
Admissible Rules of Modal Logics. J. Log. Comput. 15(4): 411-431 (2005) - 2004
- [j2]Emil Jerábek:
Dual weak pigeonhole principle, Boolean complexity, and derandomization. Ann. Pure Appl. Log. 129(1-3): 1-37 (2004) - [j1]Emil Jerábek:
A note on Grzegorczyk's logic. Math. Log. Q. 50(3): 295-296 (2004)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
